Interleaving two-phased jobs on a single machine

Authors:
Hanif D. Sherali;J. Cole Smith
Affiliations:
Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA;Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721, USA
Venue:
Discrete Optimization
Year:
2005

Citing 2
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems

Operations Research

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

Computers and Industrial Engineering
Complexity and approximation for scheduling problem for a torpedo

Computers and Industrial Engineering
Approximation algorithms for scheduling problems with exact delays

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a single machine that processes a set of jobs having two (ordered) phases. After processing the first phase of a job, this job must be removed from the machine for some exact amount of time, after which the machine must immediately begin processing its second phase. During this ''dead time'' between job phases, the machine may be used to process other similar jobs. We first prove that the problem of interleaving these jobs in order to minimize the makespan (or to process as many jobs as possible by a given deadline) is strongly NP-hard. Next, we compare the effectiveness of a mixed-integer programming formulation based on a continuous time domain to that of a discrete-time integer programming model for solving problems having different data characteristics. These comparisons are performed on a set of realistic synthetic problems based on different scenarios arising in radar pulsing applications.