Machine scheduling with an availability constraint and job delivery coordination

Research output: Journal article publicationJournal articleAcademic researchpeer-review

55 Citations (Scopus)

Abstract

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP-hard. We then propose a heuristic with a worst-case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst-case error bound of 2/3.
Original languageEnglish
Pages (from-to)11-20
Number of pages10
JournalNaval Research Logistics
Volume54
Issue number1
DOIs
Publication statusPublished - 1 Feb 2007

Keywords

  • Availability
  • Heuristics
  • Scheduling
  • Supply chain management

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this