Batch scheduling in a two-machine flow shop with limited buffer

DOI10.1016/0166-218X(95)00114-7zbMath0869.90033MaRDI QIDQ674441

Alessandro Agnetis, Dario Pacciarelli, Fabrizio Rossi

Publication date: 5 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

flow shopmakespan minimizationpolynomial timebatch processinglimited buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal versus heuristic scheduling of surface mount technology lines, Unnamed Item, Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP), An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers., Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times., Batch scheduling in a two-machine flow shop with limited buffer, Batch scheduling in the no-wait two-machine flowshop to minimize the makespan, A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Batch scheduling in a two-machine flow shop with limited buffer
• Optimal two- and three-stage production schedules with setup times included
• Flowshop scheduling with limited temporary storage
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues