Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent...

Full description

Saved in:

Bibliographic Details
Published in:	Naval research logistics Vol. 64; no. 8; pp. 628 - 641
Main Authors:	Li, Shisheng, Cheng, T.C.E., Ng, C.T., Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc 01.12.2017
Subjects:	Approximation Batch processing Compatibility Completion time Criteria dynamic programming FPTAS Lateness Mathematical models Optimization Polynomials Production scheduling Scheduling sequential and compatible batch single‐machine scheduling two agents Upper bounds
ISSN:	0894-069X, 1520-6750
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!