A two-machine flowshop sequencing problem with limited waiting time constraints
References (8)
- et al.
Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
Naval Res. Logist. Q.
(1982) - et al.
On the flowshop sequencing problem with no wait in process
Opl Res. Q.
(1972) - et al.
A microcomputer based solution to a practical scheduling problem
J. Opl Res. Soc.
(1985) Machine Scheduling Problems: Classification, Complexity and Computations
(1976)
There are more references available in the full text version of this article.
Cited by (78)
Real-time admission control in a queue-time loop production system
2021, Computers and Industrial EngineeringA comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
2020, Expert Systems with ApplicationsMinimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints
2019, Computers and Industrial EngineeringThree-machine flow shop scheduling with overlapping waiting time constraints
2019, Computers and Operations ResearchPermutation flowshop scheduling with time lag constraints and makespan criterion
2018, Computers and Industrial Engineering
Copyright © 1995 Published by Elsevier Ltd.