One-machine rescheduling heuristics with efficiency and stability as criteria
- 1 January 1993
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 20 (1) , 1-14
- https://doi.org/10.1016/0305-0548(93)90091-v
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- New Search Spaces for Sequencing Problems with Application to Job Shop SchedulingManagement Science, 1992
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Minimizing Weighted Absolute Deviation in Single Machine SchedulingIIE Transactions, 1987
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969