Single-Machine Scheduling Problems with Generalized Preemption
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[2] D. Chinhyung Cho,et al. On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..
[3] T. C. Edwin Cheng,et al. Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties , 2004, J. Sched..
[4] Philippe Baptiste,et al. A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..
[5] FRANC¸OIS M. JULIEN,et al. Generalized preemption models for single-machine dynamic scheduling problems , 1997 .
[6] Manfred Padberg,et al. On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..
[7] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[8] Brenda L. Dietrich,et al. A Column Generation Approach for Combinatorial Auctions , 2002 .
[9] Stanisław Zdrzałka,et al. Preemptive scheduling with release dates, delivery times and sequence independent setup times , 1994 .
[10] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[11] David P. Williamson,et al. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..
[12] David B. Shmoys,et al. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.
[13] Michael J. Magazine,et al. Generalized preemption models for single-machine dynamic scheduling problems , 1997 .
[14] Wallace J. Hopp,et al. Factory physics : foundations of manufacturing management , 1996 .
[15] Juan José Salazar González,et al. Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem , 1999, Discret. Appl. Math..
[16] Philippe Baptiste,et al. An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..
[17] E. L. Lawler,et al. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .
[18] Barbara B. Simons,et al. A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).