Publication:4949162
From MaRDI portal
zbMath0973.90031MaRDI QIDQ4949162
No author found.
Publication date: 27 April 2000
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
Related Items
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, Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence, 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, Batching and scheduling in a multi-machine flow shop, The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications, Two-stage hybrid flow shop scheduling with dynamic job arrivals, Two-machine flowshop batching and 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, Minimizing makespan in a two-machine flowshop scheduling with batching and release time, MIP formulations and heuristics for solving parallel batching problems, A survey of scheduling problems with setup times or costs, Batch scheduling on a two-machine jobshop with machine-dependent setup times
Cites Work
- Batch scheduling in a two-machine flow shop with limited buffer
- Batch sizing and job sequencing on a single machine
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- The complexity of one-machine batching problems
- Minimizing makespan in hybrid flowshops
- Current trends in deterministic scheduling
- Optimal two- and three-stage production schedules with setup times included
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- A Comparative Study of Flow-Shop Algorithms
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
- Scheduling Groups of Jobs on a Single Machine