Minimizing total completion time subject to job release dates and preemption penalties
From MaRDI portal
Publication:2464427
DOI10.1023/B:JOSH.0000031424.35504.c4zbMath1154.90471MaRDI QIDQ2464427
Zhaohui Liu, Cheng, T. C. Edwin
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Related Items
Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets, Approximation issues of fractional knapsack with penalties: a note, On-line production order scheduling with preemption penalties, Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting, Dynamic Windows Scheduling with Reallocation, Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect, Strong LP formulations for scheduling splittable jobs on unrelated machines, A survey of scheduling problems with setup times or costs, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Lower bounds on online deadline scheduling with preemption penalties, Split scheduling with uniform setup times
