A binary branch and bound algorithm to minimize maximum scheduling cost

This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical...

Full description

Saved in:

Bibliographic Details
Published in:	Omega (Oxford) Vol. 42; no. 1; pp. 9 - 15
Main Authors:	Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier Ltd 01.01.2014 Pergamon Press Inc
Subjects:	Algorithms Branch & bound algorithms Branch and bound Cost reduction Health service Heuristic Job shops Manufacturing Mathematical problems Optimization algorithms Production scheduling Scheduling Studies Scheduling Health service Manufacturing Branch and bound
ISSN:	0305-0483, 1873-5274
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!