Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5816382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch scheduling on two-machine flowshop with machine-dependent setup times |
scientific article; zbMATH DE number 5816382 |
Statements
Batch scheduling on two-machine flowshop with machine-dependent setup times (English)
0 references
16 November 2010
0 references
Summary: We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.
0 references
0.8995175361633301
0 references
0.8988970518112183
0 references
0.8895413279533386
0 references
0.8781847953796387
0 references
0.8776683211326599
0 references
