Model approximation for batch flow shop scheduling with fixed batch sizes
From MaRDI portal
Publication:896496
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
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- scientific article; zbMATH DE number 846900 (Why is no real title available?)
- scientific article; zbMATH DE number 1418964 (Why is no real title available?)
- scientific article; zbMATH DE number 5018129 (Why is no real title available?)
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Application of an optimization problem in max-plus algebra to scheduling problems
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Discrete lotsizing and scheduling by batch sequencing
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Linear programming. Foundations and extensions
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Model reduction of multidimensional and uncertain systems
- Modeling and analysis of timed Petri nets using heaps of pieces
- Modelling of batch production systems using Petri nets with dynamic tokens
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Single machine parallel batch scheduling subject to precedence constraints
- State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
- String execution time for finite languages: max is easy, min is hard
- The Batch Loading and Scheduling Problem
- Two-machine flow shop scheduling problems with minimal and maximal delays
Cited in
(2)
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)
