Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates

Authors:
T.C. Edwin Cheng;Natalia V. Shakhlevich
Affiliations:
Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (E-mail: mscheng@polyu.edu.hk).;National Academy of Sciences of Belarus, Surganov Street 6, 220012 Minsk, Belarus (E-mail: shah@newman.bas-net.by)
Venue:
Journal of Global Optimization
Year:
2003

Citing 5
Cited 1

Time-optimal control in a single machine problem with resource constraints

Automatica (Journal of IFAC)
Scheduling unit processing time jobs on a single machine with multiple criteria

Computers and Operations Research
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics

Scheduling with compressible and stochastic release dates

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a bicriterion approach to solve the single-machine scheduling problem in which the job release dates can be compressed while incurring additional costs. The two criteria are the makespan and the compression cost. For the case of equal job processing times, an O(n4) algorithm is developed to construct integer Pareto optimal points. We discuss how the algorithm developed can be modified to construct an ϵ-approximation of noninteger Pareto optimal points. The complexity status of the problem with total weighted completion time criterion is also established.