论文信息 - Job-shop scheduling with convex models of operations - 字舞流文

Job-shop scheduling with convex models of operations

A. Janiak | T. Szkodny

[1] J. Lenstra,et al. Job-Shop Scheduling by Implicit Enumeration , 1977 .

[2] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[3] G. Rand. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[4] H. Hamacher,et al. Algebraic Flows and Time-Cost Tradeoff Problems , 1984 .

[5] Adam Janiak,et al. Time-optimal control in a single machine problem with resource constraints , 1986, Autom..

[6] Adam Janiak,et al. Job-shop scheduling with resource-time models of operations , 1987 .

[7] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .

[8] Adam Janiak,et al. Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem , 1989, Inf. Process. Lett..