Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan

We consider a scheduling problem in which n jobs are to be processed on a single machine. The jobs are processed in batches and the processing time of each job is a simple linear function of its waiting time, i.e., the time between the start of the processing of the batch to which the job belongs an...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 202; no. 1; pp. 90 - 98
Main Authors:	Ji, Min, Cheng, T.C.E.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.04.2010 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Applied sciences Approximation Batch scheduling Batch scheduling Makespan Computational complexity FPTAS Computational complexity Dynamic programming Exact sciences and technology FPTAS Inventory control, production control. Distribution Job shops Linear programming Makespan Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Queuing theory. Traffic theory Scheduling, sequencing Studies Makespan FPTAS Batch scheduling Computational complexity Growth rate Optimal algorithm Polynomial approximation Linear time Processing time Approximation algorithm Batch processing Waiting time Precedence constraint Polynomial time Minimum time Deterioration NP hard problem Batch process Batch production Dynamic programming Single machine Completion time Execution time
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!