Model approximation for batch flow shop scheduling with fixed batch sizes
DOI10.1007/S10626-014-0195-5zbMATH Open1327.90078OpenAlexW2031154447MaRDI QIDQ896496FDOQ896496
Authors: W. Samuel Weyerman, Anurag Rai, Sean Warnick 
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
Recommendations
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
- scientific article; zbMATH DE number 764416
- Batch scheduling in a two-machine flow shop with limited buffer
- Model modification in scheduling of batch chemical processes
Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35) Max-plus and related algebras (15A80)
Cites Work
- Linear programming. Foundations and extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Modeling and analysis of timed Petri nets using heaps of pieces
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-machine flow shop scheduling problems with minimal and maximal delays
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Discrete lotsizing and scheduling by batch sequencing
- The Batch Loading and Scheduling Problem
- Model reduction of multidimensional and uncertain systems
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Single machine parallel batch scheduling subject to precedence constraints
- Title not available (Why is that?)
- String execution time for finite languages: max is easy, min is hard
- State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Modelling of batch production systems using Petri nets with dynamic tokens
- Application of an optimization problem in max-plus algebra to scheduling problems
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
Cited In (2)
Uses Software
This page was built for publication: Model approximation for batch flow shop scheduling with fixed batch sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896496)
