๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

โœ Scribed by Yin, Yunqiang; Wu, Chin-Chia; Wu, Wen-Hsiang; Hsu, Chou-Jung; Wu, Wen-Hung

Book ID
121232465
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
870 KB
Volume
13
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and bound approach for single m
A branch and bound approach for single machine scheduling with earliness and tardiness penalties
โœ Pei Chann Chang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 660 KB

An n job, single machine scheduling problem in which each job has a distinct due date, dd, is studied in this paper. The objective is to determine an optimal schedule Ir ยฐ for a set of jobs, S, such that the total absolute deviation of the schedule is minimized. This objective function is based on t