7 Citations (Scopus)

Abstract

We study a parallel batch-scheduling problem that involves the constraints of different job release times, non-identical job sizes, and incompatible job families, is addressed. Mixed integer programming (MIP) and constraint programming (CP) models are proposed and tested on a set of common problem instances from a paper in the literature. Then, we compare the performance of the models with that of a variable neighbourhood search (VNS) heuristic from the same paper. Computational results show that CP outperforms VNS with respect to solution quality and run time by 3.4~6.8% and 47~91%, respectively. When compared to optimal solutions, the results demonstrate CP is capable of generating a near optimal solution in a short amount of time.

Original languageEnglish (US)
JournalIEEE Transactions on Semiconductor Manufacturing
DOIs
StateAccepted/In press - Aug 15 2017

Fingerprint

scheduling
programming
Scheduling
Integer programming
integers

Keywords

  • Computational modeling
  • CP
  • Diffusion processes
  • incompatible
  • Job shop scheduling
  • MIP
  • parallel batching
  • Programming
  • Search problems
  • Single machine scheduling
  • VNS.

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

Cite this

@article{e1024b5292a744c9bca7f1717f4d76d5,
title = "Constraint Programming Approach for Scheduling Jobs with Release Times, Non-identical Sizes, and Incompatible Families on Parallel Batching Machines",
abstract = "We study a parallel batch-scheduling problem that involves the constraints of different job release times, non-identical job sizes, and incompatible job families, is addressed. Mixed integer programming (MIP) and constraint programming (CP) models are proposed and tested on a set of common problem instances from a paper in the literature. Then, we compare the performance of the models with that of a variable neighbourhood search (VNS) heuristic from the same paper. Computational results show that CP outperforms VNS with respect to solution quality and run time by 3.4~6.8{\%} and 47~91{\%}, respectively. When compared to optimal solutions, the results demonstrate CP is capable of generating a near optimal solution in a short amount of time.",
keywords = "Computational modeling, CP, Diffusion processes, incompatible, Job shop scheduling, MIP, parallel batching, Programming, Search problems, Single machine scheduling, VNS.",
author = "Andy Ham and John Fowler and Eray Cakici",
year = "2017",
month = "8",
day = "15",
doi = "10.1109/TSM.2017.2740340",
language = "English (US)",
journal = "IEEE Transactions on Semiconductor Manufacturing",
issn = "0894-6507",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Constraint Programming Approach for Scheduling Jobs with Release Times, Non-identical Sizes, and Incompatible Families on Parallel Batching Machines

AU - Ham, Andy

AU - Fowler, John

AU - Cakici, Eray

PY - 2017/8/15

Y1 - 2017/8/15

N2 - We study a parallel batch-scheduling problem that involves the constraints of different job release times, non-identical job sizes, and incompatible job families, is addressed. Mixed integer programming (MIP) and constraint programming (CP) models are proposed and tested on a set of common problem instances from a paper in the literature. Then, we compare the performance of the models with that of a variable neighbourhood search (VNS) heuristic from the same paper. Computational results show that CP outperforms VNS with respect to solution quality and run time by 3.4~6.8% and 47~91%, respectively. When compared to optimal solutions, the results demonstrate CP is capable of generating a near optimal solution in a short amount of time.

AB - We study a parallel batch-scheduling problem that involves the constraints of different job release times, non-identical job sizes, and incompatible job families, is addressed. Mixed integer programming (MIP) and constraint programming (CP) models are proposed and tested on a set of common problem instances from a paper in the literature. Then, we compare the performance of the models with that of a variable neighbourhood search (VNS) heuristic from the same paper. Computational results show that CP outperforms VNS with respect to solution quality and run time by 3.4~6.8% and 47~91%, respectively. When compared to optimal solutions, the results demonstrate CP is capable of generating a near optimal solution in a short amount of time.

KW - Computational modeling

KW - CP

KW - Diffusion processes

KW - incompatible

KW - Job shop scheduling

KW - MIP

KW - parallel batching

KW - Programming

KW - Search problems

KW - Single machine scheduling

KW - VNS.

UR - http://www.scopus.com/inward/record.url?scp=85028456966&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028456966&partnerID=8YFLogxK

U2 - 10.1109/TSM.2017.2740340

DO - 10.1109/TSM.2017.2740340

M3 - Article

AN - SCOPUS:85028456966

JO - IEEE Transactions on Semiconductor Manufacturing

JF - IEEE Transactions on Semiconductor Manufacturing

SN - 0894-6507

ER -