Model approximation for batch flow shop scheduling with fixed batch sizes

DOI10.1007/s10626-014-0195-5zbMath1327.90078OpenAlexW2031154447MaRDI QIDQ896496

W. Samuel Weyerman, Sean Warnick, Anurag Rai

Publication date: 9 December 2015

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/104879

zbMATH Keywords

schedulingmodel approximationbatch flow shopMax-plus

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20) Max-plus and related algebras (15A80)

Uses Software

• LPbook

Cites Work

• String execution time for finite languages: max is easy, min is hard
• Two-machine flow shop scheduling problems with minimal and maximal delays
• Modelling of batch production systems using Petri nets with dynamic tokens
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• Application of an optimization problem in max-plus algebra to scheduling problems
• Discrete Lotsizing and Scheduling by Batch Sequencing
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• The Batch Loading and Scheduling Problem
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Modeling and analysis of timed Petri nets using heaps of pieces
• Single machine parallel batch scheduling subject to precedence constraints
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Model reduction of multidimensional and uncertain systems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Linear programming. Foundations and extensions
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model approximation for batch flow shop scheduling with fixed batch sizes