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

Authors:
T. Sawik
Affiliations:
University of Mining and Metallurgy Department of Computer Integrated Manufacturing Al. Mickiewicza 30, 30-059 Kraków, Poland
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2002

Citing 5
Cited 8

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Batch scheduling in a two-machine flow shop with limited buffer

Discrete Applied Mathematics
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal
Minimizing makespan in hybrid flowshops

Operations Research Letters

An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers

Computers and Operations Research
EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS

Cybernetics and Systems
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers and Operations Research
Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

Computers and Industrial Engineering
Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers

Computers and Industrial Engineering
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

Computers and Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

The paper presents a mixed integer programming approach for makespan minimization in flexible flow lines. The line consists of several processing stages in series, separated by finite intermediate buffers, where each stage has one or more parallel identical machines. The problem objective is to determine a minimum length schedule for a mix of part types, where identical parts are scheduled consecutively. The limited intermediate buffers between the stages result in a scheduling problem with machine blocking, where a completed part may remain on a machine and block it until a downstream machine becomes available. Numerical examples modeled after real-world surface mount technology lines for printed wiring board assembly are provided and some computational results are reported to illustrate the approach.