Completing partial schedules for open shop with unit processing times and routing

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

11 Citations (Scopus)


Open Shop is a classical scheduling problem: given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job Ji ∈ J on each machine Mq ∈ M for a given amount piq of time such that each machine processes only one job at a time and each job is processed by only one machine at a time. In Routing Open Shop, the jobs are located in the vertices of an edge-weighted graph G = (V,E) whose edge weights determine the time needed for the machines to travel between jobs. The travel times also have a natural interpretation as sequence-dependent family setup times. Routing Open Shop is NP-hard for |V | = |M| = 2. For the special case with unit processing times piq = 1, we exploit Galvin’s theorem about listcoloring edges of bipartite graphs to prove a theorem that gives a sufficient condition for the completability of partial schedules. Exploiting this schedule completion theorem and integer linear programming, we show that Routing Open Shop with unit processing times is solvable in 2O(|V ||M|2 log |V ||M|) ·poly(|J |) time, that is, fixed-parameter tractable parameterized by |V | + |M|. Various upper bounds shown using the schedule completion theorem suggest it to be likewise beneficial for the development of approximation algorithms.

Original languageEnglish
Title of host publicationComputer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings
EditorsGerhard J. Woeginger, Alexander S. Kulikov
PublisherSpringer-Verlag GmbH and Co. KG
Number of pages15
ISBN (Print)9783319341705
Publication statusPublished - 1 Jan 2016
Event11th International Computer Science Symposium in Russia, CSR 2016 - St. Petersburg, Russian Federation
Duration: 9 Jun 201613 Jun 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Computer Science Symposium in Russia, CSR 2016
CountryRussian Federation
CitySt. Petersburg


  • Edge list-coloring
  • Fixed-parameter algorithm
  • NP-hard scheduling problem
  • Sequence-dependent family or batch setup times

State classification of scientific and technological information



Dive into the research topics of 'Completing partial schedules for open shop with unit processing times and routing'. Together they form a unique fingerprint.

Cite this