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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Naval research logistics Ročník 64; číslo 8; s. 628 - 641
Hlavní autori:	Li, Shisheng, Cheng, T.C.E., Ng, C.T., Yuan, Jinjiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Wiley Subscription Services, Inc 01.12.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!