Scheduling operations on parallel machine tools
- 31 May 2000
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 32 (5) , 449-459
- https://doi.org/10.1080/07408170008963921
Abstract
We introduce unique scheduling problems that arise for multiple spindle machine tools. The ability of these machines to perform simultaneous operations on more than one part creates constraints that are not found in the traditional scheduling literature. Two types of solution procedures are introduced for these problems. The first uses priority dispatching rules and a delay factor concept, while the second uses a genetic algorithm with a random keys encoding. The effectiveness of these methods is demonstrated on test problems with comparisons to lower boundsKeywords
This publication has 9 references indexed in Scilit:
- A genetic algorithm methodology for complex scheduling problemsNaval Research Logistics (NRL), 1999
- A genetic algorithm application for sequencing operations in process planning for parallel machiningIIE Transactions, 1996
- Solving a Class Scheduling Problem with a Genetic AlgorithmINFORMS Journal on Computing, 1995
- GLOBAL JOB SHOP SCHEDULING WITH A GENETIC ALGORITHMProduction and Operations Management, 1995
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1994
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling ProblemManagement Science, 1992
- New Search Spaces for Sequencing Problems with Application to Job Shop SchedulingManagement Science, 1992
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling ProblemsManagement Science, 1978
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960