Scheduling with job release dates, delivery times and preemption penalties

Authors:
Zhaohui Liu;T. C. Edwin Cheng
Affiliations:
Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China and Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China;Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China
Venue:
Information Processing Letters
Year:
2002

Citing 2
Cited 5

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
Preemptive scheduling with job-dependent setup times

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties

Journal of Scheduling
Lower bounds on online deadline scheduling with preemption penalties

Information Processing Letters
Integrated Production and Outbound Distribution Scheduling: Review and Extensions

Operations Research
Online deadline scheduling with preemption penalties

Computers and Industrial Engineering
Competitive strategies for on-line production order disposal problem

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-hard. Then, we present a dynamic programming algorithm and a polynomial time approximation scheme.