Related references
Note: Only part of the references are listed.New results for minimising variation of flow time in two-machine proportionate no-wait flow shops
S. S. Panwalkar et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2021)
Algorithms for a two-machine flowshop problem with jobs of two classes
BongJoo Jeong et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2020)
Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
Ren-Xia Chen et al.
ENGINEERING OPTIMIZATION (2019)
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion
Sergey Kovalev et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)
A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints
Mohamed Labidi et al.
IEEE ACCESS (2018)
On the exact solution of the no-wait flow shop problem with due date constraints
Hamed Samarghandi et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
A survey of scheduling problems with no-wait in process
Ali Allahverdi
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents
B. Mor et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2014)
Approximation schemes for two-machine flow shop scheduling with two agents
Wenchang Luo et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2012)
A two-machine flowshop problem with two agents
Wen-Chiung Lee et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
Faten Ben Chihaoui et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2011)
Scheduling problems with two competing agents
A Agnetis et al.
OPERATIONS RESEARCH (2004)
No-wait flowshops with bicriteria of makespan and maximum lateness
A Allahverdi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
Two-machine flow shop no-wait scheduling with a nonavailability interval
MA Kubzin et al.
NAVAL RESEARCH LOGISTICS (2004)
Simple algorithms for Gilmore-Gomory's traveling salesman and related problems
GL Vairaktarakis
JOURNAL OF SCHEDULING (2003)
No-wait flowshops with bicriteria of makespan and total completion time
A Allahverdi et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2002)
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
BMT Lin et al.
COMPUTERS & OPERATIONS RESEARCH (2001)
Share Paper
