|
Volumn 101, Issue 1 SPEC. ISS., 2006, Pages 19-29
|
A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs
|
Author keywords
Due date constraints; Heuristics; Holding cost; Job shop scheduling; Shifting bottleneck procedure
|
Indexed keywords
ALGORITHMS;
BENCHMARKING;
CONSTRAINT THEORY;
COSTS;
HEURISTIC METHODS;
PRODUCT DESIGN;
DUE-DATE CONSTRAINTS;
HEURISTICS;
HOLDING COST;
JOB-SHOP SCHEDULING;
SHIFTING BOTTLENECK PROCEDURE;
SCHEDULING;
|
EID: 29344441455
PISSN: 09255273
EISSN: None
Source Type: Journal
DOI: 10.1016/j.ijpe.2005.05.004 Document Type: Article |
Times cited : (24)
|
References (12)
|