scientific article; zbMATH DE number 1437089

zbMath0973.90031MaRDI QIDQ4949162

No author found.

Publication date: 27 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitymakespanbatchingflowshop scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Relocation scheduling subject to fixed processing sequences ⋮ Batch scheduling on a two-machine jobshop with machine-dependent setup times ⋮ A note on flow-shop and job-shop batch scheduling with identical processing-time jobs ⋮ Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ Batch scheduling on two-machine flowshop with machine-dependent setup times ⋮ Solving the serial batching problem in job shop manufacturing systems ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ A polynomial-time algorithm for a flow-shop batching problem with equal-length operations ⋮ Scheduling with batching: A review ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence ⋮ A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP ⋮ A survey of scheduling problems with setup times or costs ⋮ Batching and scheduling in a multi-machine flow shop ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Integrated problem of soaking pit heating and hot rolling scheduling in steel plants ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ Batch scheduling in the no-wait two-machine flowshop to minimize the makespan ⋮ Two-machine flowshop batching and scheduling ⋮ Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop ⋮ The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications

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

This page was built for publication: