A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

0.00 Avg rating—0 Votes
Article ID: iaor1990141
Country: United Kingdom
Volume: 17
Start Page Number: 321
End Page Number: 324
Publication Date: Apr 1990
Journal: Computers and Operations Research
Authors:
Abstract:

This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs.

Reviews

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