A GRASP™ for a difficult single machine scheduling problem
- 31 December 1991
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 18 (8), 635-643
- https://doi.org/10.1016/0305-0548(91)90001-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Flight Scheduling and Maintenance Base PlanningManagement Science, 1989
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- Note—Operations Sequencing in Discrete Parts ManufacturingManagement Science, 1989
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of LatenessManagement Science, 1988
- A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbiddenComputers & Operations Research, 1987
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987
- Scheduling Tasks with Due Dates in a Fabrication/Assembly ProcessOperations Research, 1987
- Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with DeadlinesOperations Research, 1987
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956