Flowshop/no-idle scheduling to minimize total elapsed time

Flowshop/no-idle scheduling to minimize total elapsed time

0.00 Avg rating0 Votes
Article ID: iaor2006804
Country: Germany
Volume: 33
Issue: 3
Start Page Number: 349
End Page Number: 367
Publication Date: Nov 2005
Journal: Journal of Global Optimization
Authors: ,
Keywords: flowshop
Abstract:

This paper studies four n-job, m-machine flowshop problems when processing times of jobs on various machines follow certain conditions. The objective is to obtain a sequence, which minimizes total elapsed time under no-idle constraint. Under no-idle constraint, the machines work continuously without idle-interval. We prove two theorems. We introduce simple algorithms without using branch and bound technique. Numerical examples are also given to demonstrate the algorithms.

Reviews

Required fields are marked *. Your email address will not be published.