Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job’s processing time is an increasing simple linear function of its starting time. The machine can process up to b jobs simultaneously as a batch. The objective is to minimize the maximu...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 210; no. 3; pp. 482 - 488
Main Authors:	Li, Shisheng, Ng, C.T., Cheng, T.C.E., Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.05.2011 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Approximation Batching Deterioration Dynamic programming Exact sciences and technology Infinity Inventory control, production control. Distribution Job shops Mathematical analysis Mathematical models Mathematical programming Operational research Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Release dates Scheduling Scheduling Batching Deterioration Release dates Dynamic programming Scheduling, sequencing Studies Batching Scheduling Dynamic programming Release dates Deterioration Task scheduling Processing time Makespan Approximation algorithm Modeling Batch scheduling Workload Batchwise NP hard problem Batch process Batch production 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!