A V-shape property of optimal schedule of jobs about a common due date
type: Item
instance of: scholarly article
title: A V-shape property of optimal schedule of jobs about a common due date
zbMATH Open document ID: 0584.90043
DOI: 10.1016/0377-2217(86)90306-1
author: M. Raghavachari
published in: European Journal of Operational Research
publication date: 1986-01-01T00:00:00Z
review text: \textit{J. J. Kanet} [Nav. Res. Logist. Q. 28, 643-651 (1981; Zbl 0548.90037)] considered the problem of minimizing the average deviation of job completion times about a common due date when the due date exceeds the make-span of the job set. In this note we establish the V-shape of an optimal schedule for any common due date. The V-shape means that in the optimal schedule the jobs are processed according to decreasing order of processing times until the job with the shortest processig time is completed and then the jobs are scheduled according to increasing order of processing times. \textit{S. Eilon} and \textit{I. G. Chowdhury} [Manage. Sci. 23, 567-575 (1977; Zbl 0362.90051)] proved the V-shape of optimal schedules for yet another class of single machine sequencing problems.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 3936911
zbMATH Keywords: V-shape of an optimal schedule
zbMATH Keywords: common due date
MaRDI profile type: Publication
full work available at URL: 0377-2217(86)90306-1
OpenAlex ID: W2078955415
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: Minimizing the average deviation of job completion times about a common due date
description: scientific article; zbMATH DE number 3936911