Job-shop scheduling with processing alternatives

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances.

Original languageEnglish
Pages (from-to)307-332
Number of pages26
JournalEuropean Journal of Operational Research
Volume151
Issue number2
DOIs
Publication statusPublished - Dec 1 2003

Fingerprint

Job Shop Scheduling
Subroutines
scheduling
heuristics
Alternatives
Processing
Schedule
Routing
Tabu search
Heuristics
Heuristic algorithms
Open Shop
tabu
Job Shop Scheduling Problem
Directed Acyclic Graph
Tabu Search
Genetic algorithms
Partial Order
Heuristic algorithm
Test Problems

Keywords

  • Genetic algorithms
  • Insertion techniques
  • Job-shop
  • Open-shop
  • Scheduling
  • Tabu search

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Job-shop scheduling with processing alternatives. / Kis, T.

In: European Journal of Operational Research, Vol. 151, No. 2, 01.12.2003, p. 307-332.

Research output: Contribution to journalArticle

@article{46185613e799425da1faf480b8e5c4ab,
title = "Job-shop scheduling with processing alternatives",
abstract = "In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances.",
keywords = "Genetic algorithms, Insertion techniques, Job-shop, Open-shop, Scheduling, Tabu search",
author = "T. Kis",
year = "2003",
month = "12",
day = "1",
doi = "10.1016/S0377-2217(02)00828-7",
language = "English",
volume = "151",
pages = "307--332",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Job-shop scheduling with processing alternatives

AU - Kis, T.

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances.

AB - In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances.

KW - Genetic algorithms

KW - Insertion techniques

KW - Job-shop

KW - Open-shop

KW - Scheduling

KW - Tabu search

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

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

U2 - 10.1016/S0377-2217(02)00828-7

DO - 10.1016/S0377-2217(02)00828-7

M3 - Article

VL - 151

SP - 307

EP - 332

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -