Two parallel machine sequencing problems involving controllable job processing times

Two parallel machine sequencing problems involving controllable job processing times

0.00 Avg rating0 Votes
Article ID: iaor199786
Country: Netherlands
Volume: 70
Issue: 3
Start Page Number: 335
End Page Number: 341
Publication Date: Nov 1993
Journal: European Journal of Operational Research
Authors: ,
Abstract:

In this note the authors consider a problem of scheduling n single-operation jobs on m non-identical machines where the sequencing of the jobs and their processing times are decision variables. It is assumed that the cost of performing a job is a linear function of its processing time. The scheduling cost to be minimized is: (A) the total processing cost plus total flow time, (B) the total processing cost plus total weighted earliness and weighted tardiness. The authors reduce each problem to a transportation problem that can be solved by a polynomial time algorithm.

Reviews

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