scientific article; zbMATH DE number 1437089
From MaRDI portal
Publication:4949162
Recommendations
- Two-machine flowshop batching and scheduling
- Batch scheduling in a two-stage flexible flow shop problem
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
Cites work
- A Comparative Study of Flow-Shop Algorithms
- A polynomial algorithm for a one machine batching problem
- Batch scheduling in a two-machine flow shop with limited buffer
- Batch sizing and job sequencing on a single machine
- Current trends in deterministic scheduling
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Minimizing makespan in hybrid flowshops
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- One-pass batching algorithms for the one-machine problem
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Optimal two- and three-stage production schedules with set-up time included
- Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
- Scheduling Groups of Jobs on a Single Machine
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
- The Complexity of Flowshop and Jobshop Scheduling
- The complexity of one-machine batching problems
Cited in
(44)- The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Two-stage hybrid flow shop scheduling with dynamic job arrivals
- Two-machine flowshop batching and scheduling
- Two-machine shop scheduling problems with batch processing
- Minimizing makespan in batch machine scheduling
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- Solving the serial batching problem in job shop manufacturing systems
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Scheduling with batching: A review
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time
- MIP formulations and heuristics for solving parallel batching problems
- Part batching and scheduling in a flexible cell to minimize setup costs
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- A survey of scheduling problems with setup times or costs
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- scientific article; zbMATH DE number 1731176 (Why is no real title available?)
- Relocation scheduling subject to fixed processing sequences
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Batch scheduling on a two-machine jobshop with machine-dependent setup times
- Batch-size-based rearrangement of the shop floor into mini-lines
- Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- Scheduling production tasks in a two-stage FMS
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- Minimizing makespan on a two-machine re-entrant flowshop
- Flowshop-scheduling problems with makespan criterion: a review
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
- Batch scheduling in a two-stage flexible flow shop problem
- Batching and scheduling in a multi-machine flow shop
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4949162)
