Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated

被引：27

作者：

Brown, SI

McGarvey, R

Ventura, JA ^{[1
]}

机构：

[1] Penn State Univ, Harold & Inge Marcus Dept Ind & Mfg Engn, University Pk, PA 16802 USA

[2] RAND Corp, Pittsburgh, PA USA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2004年 / 55卷 / 06期

关键词：

scheduling flowshop; no-wait; heuristics; integer programming; travelling salesman;

D O I：

10.1057/palgrave.jors.2601695

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper addresses the m-machine no-wait flowshop problem where the set-up time of a job is separated from its processing time. The performance measures considered are the total flowtime and makespan. The scheduling problem for makespan reduces to the travelling salesman problem (TSP), and the scheduling problem for total flowtime reduces to the time-dependent travelling salesman problem (TDTSP). Non-polynomial time solution methods are presented, along with a polynomial heuristic.

引用

页码：614 / 621

页数：8

共 50 条

[31] Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time
Aldowaisan, T
Allahverdi, A
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2004, 11 (02): : 113 - 123
[32] Solving the no-wait flow-shop problem with sequence-dependent set-up times
Samarghandi, Hamed
ElMekkawy, Tarek Y.
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (03) : 213 - 228
[33] Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times
Chang, JL
Yan, WW
Shao, HH
PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 1412 - 1416
[34] Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
Aydilek, Harun
Aydilek, Asiye
Allahverdi, Ali
ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1417 - 1430
[35] A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Allahverdi, A
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (02) : 157 - 180
[36] Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times
Neufeld, J. S.
Gupta, J. N. D.
Buscher, U.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (06) : 1791 - 1806
[37] A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop
Ben-Yehoshua, Yoav
Hariri, Eyal
Mosheiov, Gur
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (19) : 5717 - 5724
[38] A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Khan, B. Shahul Hamid
Prabhaharan, G.
Asokan, P.
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2007, 84 (12) : 1731 - 1741
[39] An improved algorithm to minimize the total completion time in a two-machine no-wait flowshop with uncertain setup times
Allahverdi, Muberra
JOURNAL OF PROJECT MANAGEMENT, 2022, 7 (01) : 1 - 12
[40] An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Nagano, Marcelo Seido
de Almeida, Fernando Siqueira
Miyata, Hugo Hissashi
ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1431 - 1449

← 1 2 3 4 5 →