A Divide-and-Merge Algorithm for a Single Machine Scheduling Problem

We introduce a divide-and-merge algorithm for solving single machine scheduling problems. Given an instance of a problem, our algorithm divides the problem into k (small) subproblem instances using a feasible solution as a basis. After optimizing each subproblem, the approach uses the special struct...

Full description

Saved in:
Bibliographic Details
Published inIISE Annual Conference. Proceedings p. 1
Main Authors Colak, Arife Burcu, Keha, Ahmet B
Format Journal Article
LanguageEnglish
Published Norcross Institute of Industrial and Systems Engineers (IISE) 01.01.2006
Subjects
Algorithms
Job shops
Machinery
Optimization
Scheduling
Online AccessGet full text

Cover

More Information
Summary:We introduce a divide-and-merge algorithm for solving single machine scheduling problems. Given an instance of a problem, our algorithm divides the problem into k (small) subproblem instances using a feasible solution as a basis. After optimizing each subproblem, the approach uses the special structure of the problem to merge their solutions to form a complete solution to the original problem. We provide some computational results that show the effectiveness of our algorithm. [PUBLICATION ABSTRACT]