The job shop scheduling problem: Conventional and new solution techniques
- 23 August 1996
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 93 (1), 1-33
- https://doi.org/10.1016/0377-2217(95)00362-2
Abstract
No abstract availableThis publication has 128 references indexed in Scilit:
- A generalized permutation approach to job shop scheduling with genetic algorithmsOR Spectrum, 1995
- Solving the job shop scheduling problem with tabu searchIIE Transactions, 1995
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobsOR Spectrum, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A modified shifting bottleneck procedure for job-shop schedulingInternational Journal of Production Research, 1993
- Permutation vs. non-permutation flow shop schedulesOperations Research Letters, 1991
- Job-shop scheduling: limits of the binary disjunctive formulationInternational Journal of Production Research, 1990
- A survey of priority rule-based schedulingOR Spectrum, 1989
- An extension of Palmer's heuristic for the flow shop scheduling problemInternational Journal of Production Research, 1988
- A problem expanding parametric programming method for solving the job shop scheduling problemAnnals of Operations Research, 1985