𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-machine flowshop scheduling with bicriteria problem

✍ Scribed by Fuh-Der Chou; Ching-En Lee

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
198 KB
Volume
36
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

This paper attempts to solve a two-machine Β―owshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total Β―ow time and makespan. To tackle this scheduling problem, an integer programming model with N 2 +3N variables and 5N constraints where N is the number of jobs, is formulated. Because of the lengthy computing time and high computing complexity of the integer programming model, a heuristic scheduling algorithm is presented. Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. The average solution quality of the heuristic algorithm is above 99% and is much better than that of the SPT rule as a benchmark. A 15-job case requires only 0.018 s, on average, to obtain an ultimate or even optimal solution. The heuristic scheduling algorithm is a more practical approach to real world applications than the integer programming model.

πŸ“œ SIMILAR VOLUMES

A bicriteria two-machine permutation flo
A bicriteria two-machine permutation flowshop problem
✍ Funda Sivrikaya-Şerifoğlu; GΓΌndΓΌz Ulusoy πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 263 KB

The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available. All jobs are available at the beginning of the scheduling period. Setup times are included in the processing times. No preemption of jobs is allowed. The objective is the mi

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
✍ Wei-Chang Yeh πŸ“‚ Article πŸ“… 2001 πŸ› Society of Manufacturing Engineers 🌐 English βš– 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

Two-machine flowshop scheduling with ava
Two-machine flowshop scheduling with availability constraints
✍ Chung-Yee Lee πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 143 KB

The majority of the scheduling literature carries a common assumption that machines are available all the time. However, this availability assumption may not be true in real industry settings, since a machine may become unavailable during certain periods of time when, for instance, a machine breakdo