Minimizing tardy jobs in a two-stage hybrid flowshop

被引：34

作者：

Gupta, JND ^{[1
]}

Tunc, EA ^{[1
]}

机构：

[1] Ball State Univ, Dept Management, Muncie, IN 47306 USA

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1998年 / 36卷 / 09期

关键词：

D O I：

10.1080/002075498192599

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the two-stage hybrid flowshop problem with the objective of minimizing the total number of tardy jobs. Since this problem is strongly NP-hard, several heuristic algorithms are developed to find optimal or near optimal schedule for the case when the first stage contains only one machine and the second stage contains rn identical parallel machines. Results of computational tests in solving problems up to 100 jobs are reported and directions for future research are provided.

引用

页码：2397 / 2417

页数：21

共 8 条

[1] BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS [J].

BRAH, SA ;

HUNSUCKER, JL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (01) :88-99

[2] SCHEDULES FOR A 2-STAGE HYBRID FLOWSHOP WITH PARALLEL MACHINES AT THE 2ND STAGE [J].

GUPTA, JND ;

TUNC, EA .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (07) :1489-1502

[3]

Gupta JND, 1997, J OPER RES SOC, V48, P212, DOI 10.1057/palgrave.jors.2600346

[4] INTEGER PROGRAMMING FORMULATIONS FOR THE MULTI-DEPOT VEHICLE-ROUTING PROBLEM - COMMENTS [J].

LAPORTE, G .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :227-227

[5] FLOWSHOP SCHEDULING WITH DOMINANT MACHINES [J].

HO, JC ;

GUPTA, JND .

COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (02) :237-246

[6]

Lawler E. L., 1993, LOGISTICS PRODUCTION, V4, P445, DOI [10.1016/S0927-0507(05)80189-6, DOI 10.1016/S0927-0507(05)80189-6]

[7]

Lenstra, 1977, ANN DISCRETE MATH, V1, P343, DOI DOI 10.1016/S0167-5060(08)70743-X

[8] N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].

MOORE, JM .

MANAGEMENT SCIENCE, 1968, 15 (01) :102-109

← 1 →