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

DOI10.1016/0166-218X(95)00114-7MaRDI QIDQ674441zbMATH OpenFDO

Authors 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 shoppolynomial timemakespan minimizationbatch processinglimited buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 764416
• Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
• An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 864788 (Why is no real title available?)
• Batch scheduling in a two-machine flow shop with limited buffer
• Flowshop scheduling with limited temporary storage
• Optimal two- and three-stage production schedules with set-up time included
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

Cited in

(16)

• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• scientific article; zbMATH DE number 764416 (Why is no real title available?)
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
• Optimal versus heuristic scheduling of surface mount technology lines
• MIP Formulations for Flowshop Scheduling with Limited Buffers
• Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
• Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system
• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
• An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
• Model approximation for batch flow shop scheduling with fixed batch sizes
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
• scientific article; zbMATH DE number 1437089 (Why is no real title available?)
• Batch scheduling in a two-machine flow shop with limited buffer
• scientific article; zbMATH DE number 4152123 (Why is no real title available?)

This page was built for publication: Batch scheduling in a two-machine flow shop with limited buffer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674441)