Parallel Machine Scheduling With Tool Loading: a Constraint Programming Approach

Loading...
Publication Logo

Date

2018

Authors

Gokgur, Burak
Özpeynirci, Selin

Journal Title

Journal ISSN

Volume Title

Publisher

Taylor & Francis Ltd

Open Access Color

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Top 10%
Influence
Top 10%
Popularity
Top 10%

Research Projects

Journal Issue

Abstract

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.

Description

Keywords

parallel machines, scheduling, constraint programming, makespan, tool loading, Flexible Manufacturing Systems, Unary Resource Constraint, Eligibility Restrictions, Due-Date, Management, Satisfaction, Transporter, Algorithms, Models

Fields of Science

0211 other engineering and technologies, 02 engineering and technology

Citation

WoS Q

Q1

Scopus Q

Q1
OpenCitations Logo
OpenCitations Citation Count
39

Source

Internatıonal Journal of Productıon Research

Volume

56

Issue

16

Start Page

5541

End Page

5557
PlumX Metrics
Citations

CrossRef : 10

Scopus : 58

Captures

Mendeley Readers : 38

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
7.15822621

Sustainable Development Goals