Parallel machine scheduling with tool loading: a constraint programming approach

This paper presents constraint programming models that aim to solve scheduling and tool assignment problems in parallel machine environments. There are a number of jobs to be processed on parallel machines. Each job requires a set of tools, but limited number of tools are available in the system due...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 56; no. 16; pp. 5541 - 5557
Main Authors Gökgür, Burak, Hnich, Brahim, Özpeynirci, Selin
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 18.08.2018
Taylor & Francis LLC
Subjects
Online AccessGet full text
ISSN0020-7543
1366-588X
DOI10.1080/00207543.2017.1421781

Cover

More Information
Summary:This paper presents constraint programming models that aim to solve scheduling and tool assignment problems in parallel machine environments. There are a number of jobs to be processed on parallel machines. Each job requires a set of tools, but limited number of tools are available in the system due to economic restrictions. The problem is to assign the jobs and the required tools to machines and to determine the schedule so that the makespan is minimised. Three constraint programming models are developed and compared with existing methods described in the literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2017.1421781