An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.

DOI10.1016/S0895-7177(02)00176-0zbMath1052.90038MaRDI QIDQ1410120

Tadeusz J. Sawik

Publication date: 14 October 2003

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

Mixed integer programmingBatch schedulingHybrid flowshopLimited buffersSurface mount technology line

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines ⋮ EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Cites Work

• Batch scheduling in a two-machine flow shop with limited buffer
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Minimizing makespan in hybrid flowshops
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Optimal two- and three-stage production schedules with setup times included
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Flowshop scheduling with limited temporary storage
• An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
• Mixed integer programming for scheduling surface mount technology lines
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.