Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers

Authors:
T. Sawik
Affiliations:
University of Mining and Metallurgy Faculty of Management Department of Computer Integrated Manufacturing Al. Mickiewicza 30, 30-059 Krakow, Poland
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2000

Citing 6
Cited 12

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Mathematical programming for the scheduling problem with alternate process plans in FMS

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Scheduling with Finite Capacity Input Buffers

Operations Research
Scheduling with Finite Capacity Output Buffers

Operations Research
Simultaneous loading, routing, and assembly plan selection in a flexible assembly system

Mathematical and Computer Modelling: An International Journal
Integer programming models for the design and balancing of flexible assembly systems

Mathematical and Computer Modelling: An International Journal

An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
A memetic algorithm for the flexible flow line scheduling problem with processor blocking

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

Cybernetics and Systems
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
Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems

Journal of Intelligent Manufacturing
MIP formulations for flowshop scheduling with limited buffers

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
A water-flow algorithm for flexible flow shop scheduling with intermediate buffers

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

Mathematical and Computer Modelling: An International Journal
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper presents new mixed integer programming formulations for scheduling of a flexible flow line with blocking. The flexible flow line consists of several processing stages in series, separated by finite intermediate buffers, where each stage has one or more identical parallel machines. The line produces several different product types and each product must be processed by, at most, one machine in each stage. A product which has completed processing on a machine may remain there and block the machine until a downstream machine becomes available for processing. The objective is to determine a production schedule for all products so as to complete the products in a minimum time. The basic mixed integer programming formulations have been enhanced to model blocking scheduling with alternative processing routes where for each product a set of routes is available for processing. A reentrant flow line where a product visits a set of stages more than once is also considered. Numerical examples are presented to illustrate applications of the various models proposed.