Flowshop scheduling problem to minimize total completion time with random and bounded processing times
Authors:
- 1 March 2004
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 55 (3) , 277-286
Abstract
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.Keywords
This publication has 22 references indexed in Scilit:
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing timesInternational Transactions in Operational Research, 2003
- New heuristics to minimize total completion time in m-machine flowshopsInternational Journal of Production Economics, 2002
- Sequencing with uncertain numerical data for makespan minimisationJournal of the Operational Research Society, 1999
- Stochastically minimizing total flowtime in flowshops with no waiting spaceEuropean Journal of Operational Research, 1999
- Stochastically minimizing the makespan in two-machine flow shops without blockingEuropean Journal of Operational Research, 1999
- Cyclic scheduling of a hoist with time window constraintsIEEE Transactions on Robotics and Automation, 1998
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobsEuropean Journal of Operational Research, 1997
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- The complexity of shop-scheduling problems with two or three jobsEuropean Journal of Operational Research, 1991
- General flow-shop scheduling with resource constraintsInternational Journal of Production Research, 1988