Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to mi...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & industrial engineering Vol. 59; no. 4; pp. 794 - 798
Main Authors:	Ji, Min, Cheng, T.C.E.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.11.2010 Pergamon Press Inc
Subjects:	0–1 integer programming Approximation Availability Availability constraint Computational complexity Deterioration FPTAS Industrial engineering Integer programming Job shops Mathematical analysis Optimization Polynomials Production scheduling Scheduling Studies Time management Availability constraint Scheduling FPTAS Computational complexity 0–1 integer programming
ISSN:	0360-8352, 1879-0550
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!