Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- 12 February 2018
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 267 (1-2) , 101-134
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Scheduling flow lines with buffers by ant colony digraphExpert Systems with Applications, 2013
- Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraintsJournal of Manufacturing Systems, 2013
- Generalized disjunctive constraint propagation for solving the job shop problem with time lagsEngineering Applications of Artificial Intelligence, 2011
- Two-machine flow shop scheduling problems with minimal and maximal delays4OR, 2006
- Multicriteria scheduling problems: a surveyRAIRO - Operations Research, 2001
- Single machine scheduling with chain: structured precedence constraints and separation time windowsIEEE Transactions on Robotics and Automation, 1996
- A two-machine flowshop sequencing problem with limited waiting time constraintsComputers & Industrial Engineering, 1995
- Two-Stage Flowshop Scheduling Problem with BicriteriaJournal of the Operational Research Society, 1992
- Permutation vs. non-permutation flow shop schedulesOperations Research Letters, 1991
- A Microcomputer Based Solution to a Practical Scheduling ProblemJournal of the Operational Research Society, 1985