Single machine scheduling with discretely controllable processing times

In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 21; no. 2; pp. 69 - 76
Main Authors: Chen, Zhi-Long, Lu, Qing, Tang, Guochun
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.09.1997
Elsevier
Subjects:
Applied sciences
Discretely controllable processing times
Dynamic programming
Exact sciences and technology
NP-hardness
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Single machine scheduling
NP-hardness
Dynamic programming
Discretely controllable processing times
Single machine scheduling
Algorithms
NP hard problem
Production
Scheduling
Computational complexity
Single machine
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are discretely controllable, i.e. the possible processing time of a job can only be controlled to be some specified lengths. Under this discrete model, we consider a class of single machine problems with the objective of minimizing the sum of the total processing cost and the cost measured by a standard criterion. We investigate most common criteria, e.g. makespan, maximum tardiness, total completion time, weighted number of tardy jobs, and total earliness-tardiness penalty. The computational complexity of each problem is analyzed, and pseudo-polynomial dynamic programming algorithms are proposed for hard problems.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(97)00010-2