Job-shop scheduling with blocking and no-wait constraints
Top Cited Papers
- 16 December 2002
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 143 (3), 498-517
- https://doi.org/10.1016/s0377-2217(01)00338-1
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- A mathematical programming model for scheduling steelmaking-continuous casting productionEuropean Journal of Operational Research, 2000
- Railway traffic control and train scheduling based oninter-train conflict managementTransportation Research Part B: Methodological, 1999
- On-line timetable re-scheduling in regional train servicesTransportation Research Part B: Methodological, 1999
- The permutation flow shop with buffers: A tabu search approachEuropean Journal of Operational Research, 1999
- Greedy heuristics for rapid scheduling of trains on a single trackIIE Transactions, 1998
- Scheduling high-grade steelmakingIEEE Expert, 1996
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Predicting deadlock in store-and-forward networksNetworks, 1990
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980