A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes

DOI10.1007/978-0-387-74905-1_11zbMATH Open1154.90486OpenAlexW79234953MaRDI QIDQ3606053FDOQ3606053

Authors: Amir Shafeeq, Mohammad Ibrahim Abdul Mutalib, K. A. Amminudin, Ayyaz Muhammad 

Publication date: 26 February 2009

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-74905-1_11

Recommendations

• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Makespan estimation and order acceptance in batch process industries when processing times are uncertain
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Analysis of deadlock and circular waits using a matrix model for flexible manufacturing systems
• Matrix-analytic solutions in production lines without buffers

zbMATH Keywords

schedulingmakespanmultiproductzero wait

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes

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