Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
type: Item
instance of: scholarly article
title: Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
zbMATH Open document ID: 1128.90028
author: Jeffrey D. Laub
author: John Fowler
author: Ahmet Keha
published in: European Journal of Operational Research
publication date: 2007-05-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 5151725
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: multiple-orders-per-job
zbMATH Keywords: semiconductor manufacturing
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.07.023
OpenAlex ID: W2020310393
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: The Batch Loading and Scheduling Problem
cites work: Q3525911
cites work: Flow shop scheduling with lot streaming
cites work: Scheduling with batching: A review
cites work: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
cites work: Scheduling a single batch processing machine with non-identical job sizes
DOI: 10.1016/J.EJOR.2006.07.023
description: scientific article; zbMATH DE number 5151725