Makespan scheduling for a class of continuous production with buffers

Makespan scheduling for a class of continuous production with buffers

0.00 Avg rating0 Votes
Article ID: iaor20013931
Country: China
Volume: 18
Issue: 3
Start Page Number: 43
End Page Number: 48
Publication Date: May 2000
Journal: Systems Engineering
Authors: , ,
Keywords: programming: linear
Abstract:

The scheduling for a class of productions with piecewise production tasks and makespan requirements is studied. Through transforming the constraints in integration form and on the single product manufacturing, the problem can be solved with linear programming. Simulation for an actual example indicates that the algorithm mentioned is available.

Reviews

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