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

DOI10.1016/S0895-7177(02)00176-0zbMATH Open1052.90038MaRDI QIDQ1410120FDOQ1410120

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

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

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• 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
• Minimizing makespan in hybrid flowshops
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Batch scheduling in a two-machine flow shop with limited buffer
• Flowshop scheduling with limited temporary storage
• Mixed integer programming for scheduling surface mount technology lines
• An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

Cited In (14)

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

   Recommendations

• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers 👍 👎
• Mixed integer programming for scheduling surface mount technology lines 👍 👎
• Optimal versus heuristic scheduling of surface mount technology lines 👍 👎
• Scheduling flexible flow lines with no in-process buffers 👍 👎
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410120)