Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling

Authors:
Suk-Hun Yoon;Jose A. Ventura
Affiliations:
Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 356 Leonhard Building, University Park, PA;Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 356 Leonhard Building, University Park, PA
Venue:
Computers and Operations Research
Year:
2002

Citing 6
Cited 6

Sequencing with earliness and tardiness penalties: a review

Operations Research
A pairwise interchange solution procedure for a scheduling problem with production of components at a single facility

Computers and Industrial Engineering
Unit sized transfer batch scheduling with setup times

Computers and Industrial Engineering
Basic techniques for lot streaming

Operations Research
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Structural Properties of Lot Streaming in a Flow Shop

Mathematics of Operations Research

Lot streaming for product assembly in job shop environment

Robotics and Computer-Integrated Manufacturing
Queueing network analysis on dynamic lot streaming

Computers and Operations Research
An evolutionary algorithm for assembly job shop with part sharing

Computers and Industrial Engineering
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Expert Systems with Applications: An International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Information Sciences: an International Journal
A differential evolution algorithm for lot-streaming flow shop scheduling problem

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots so that successive operations can be overlapped in a multi-stage production system. This paper presents a procedure for minimizing the mean weighted absolute deviation from due dates when jobs are scheduled in a lot-streaming flow shop. This performance criterion has been shown to be non-regular and requires a search among schedules with inserted idle times to find an optimal solution. For a given job sequence, we present linear programming formulations to obtain optimal sublot completion times for cases where buffers between successive machines have limited or infinite capacities, and sublots have equal-size or are consistent. A no-wait flow shop problem is also considered. Sixteen pairwise interchange methods are considered to generate the best sequences. These algorithms are obtained by combining four rules to generate initial sequences with four neighborhood search mechanisms. Computational experiments are conducted on 140 test problems. The results show that the best solutions are obtained by the heuristic algorithm with a non-adjacent pairwise interchange method and the smallest overall slack time rule to generate the initial sequence.