Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Authors:
John J. Kanet;V. Sridharan
Affiliations:
-;-
Venue:
Operations Research
Year:
2000

Citing 0
Cited 18

Two parallel machines scheduling

Systems Analysis Modelling Simulation
Single machine scheduling with early and quadratic tardy penalties

Computers and Industrial Engineering
Machine scheduling with earliness, tardiness and non-execution penalties

Computers and Operations Research
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

Computers and Operations Research
A comparison of lower bounds for the single-machine early/tardy problem

Computers and Operations Research
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties

Computers and Industrial Engineering
Scheduling for stability in single-machine production systems

Journal of Scheduling
Preemption in single machine earliness/tardiness scheduling

Journal of Scheduling
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Computers and Operations Research
Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time

Computers and Industrial Engineering
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties

Computers and Operations Research
Solving a stochastic single machine problem with initial idle time and quadratic objective

Computers and Operations Research
Scheduling with a common due-window: Polynomially solvable cases

Information Sciences: an International Journal
Flow shops with WIP and value added costs

Journal of Scheduling
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

Journal of Scheduling
Group sequencing around a common due date

Discrete Optimization
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

Information Sciences: an International Journal
Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay

Manufacturing & Service Operations Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and/or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research.