Single-machine sequencing with controllable processing times

Single-machine sequencing with controllable processing times

0.00 Avg rating0 Votes
Article ID: iaor1996490
Country: Netherlands
Volume: 59
Issue: 2
Start Page Number: 298
End Page Number: 302
Publication Date: Jun 1992
Journal: European Journal of Operational Research
Authors: ,
Abstract:

The authors consider a static single-machine sequencing problem in which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness costs, and total processing cost.

Reviews

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