Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times

Lika Ben-Dati, Gur Mosheiov and Daniel Oron

Advances in Operations Research, 2009, vol. 2009, 1-10

Abstract:

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.

Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2009/153910.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2009/153910.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:153910

DOI: 10.1155/2009/153910

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().