Machine scheduling and Lagrangian relaxation
暂无分享,去创建一个
[1] G. Rand. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .
[2] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[3] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .
[5] M. Rosenwein,et al. An application-oriented guide for designing Lagrangean dual ascent algorithms , 1989 .
[6] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[7] S. L. Velde. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .
[8] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[9] Neta Amit,et al. Openshop and flowshop scheduling to minimize sum of completion times , 1984, Comput. Oper. Res..
[10] G. Leong,et al. Single machine scheduling: A comparison of two solution procedures , 1987 .
[11] R. A. Dudek,et al. Optimality Criteria for Flowshop Schedules , 1971 .
[12] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[13] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[14] Nicos Christofides,et al. The Shortest Hamiltonian Chain of a Graph , 1970 .
[15] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[16] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[17] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..
[18] Marshall L. Fisher,et al. Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..
[19] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[20] Timothy D. Fry,et al. A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden , 1987, Comput. Oper. Res..
[21] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[22] Maurice Queyranne,et al. On the One-Dimensional Space Allocation Problem , 1981, Oper. Res..
[23] S. Bansal. Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .
[24] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[25] A. M. Geoffrion. Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .
[26] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .
[27] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[28] Prabuddha De,et al. SCHEDULING TO MINIMIZE MAKESPAN ON UNEQUAL PARALLEL PROCESSORS , 1980 .
[29] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .
[30] Oscar H. Ibarra,et al. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.
[31] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[32] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[33] Han Hoogeveen. Minimizing Maximum Earliness and Maximum Lateness on a Single Machine , 1990, IPCO.
[34] J. Shapiro. A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .
[35] Teofilo F. Gonzalez,et al. Optimal Preemptive Scheduling of Two Unrelated Processors , 1990, INFORMS J. Comput..
[36] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..
[37] L. V. Wassenhove,et al. An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .
[38] C. Potts. A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .
[39] M. Bazaraa,et al. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .
[40] Hamilton Emmons,et al. Scheduling to a common due date on parallel uniform processors , 1987 .
[41] J. A. Hoogeveen,et al. Minimizing total inventory cost on a single machine in just-in-time manufacturing , 1992 .
[42] Wlodzimierz Szwarc,et al. The Flow-Shop Problem with Mean Completion Time Criterion , 1983 .
[43] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[44] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[45] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .
[46] E. Lawler. Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .
[47] Marshall L. Fisher,et al. An Applications Oriented Guide to Lagrangian Relaxation , 1985 .
[48] Ronald L. Rardin,et al. Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..
[49] Vijay Aggarwal,et al. A Lagrangean-relaxation method for the constrained assignment problem , 1985, Comput. Oper. Res..
[50] S. L. van deVelde. Dual decomposition of single-machine scheduling problems , 1990 .
[51] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[52] W. Szwarc. Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .
[53] Chris N. Potts,et al. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..
[54] M. Fisher,et al. Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .
[55] E. Balas. On the facial structure of scheduling polyhedra , 1985 .
[56] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .
[57] Martin E. Dyer,et al. Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..
[58] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[59] W. A. Horn. Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .
[60] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[61] K. Jörnsten,et al. A new Lagrangian relaxation approach to the generalized assignment problem , 1986 .
[62] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[63] Chris N. Potts,et al. An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..
[64] Marc E. Posner,et al. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..
[65] Kathryn E. Stecke,et al. A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems , 1986 .
[66] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[67] Monique Guignard-Spielberg,et al. A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..
[68] Jeffrey B. Sidney,et al. Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..
[69] Mark H. Karwan,et al. A computational evaluation of two subgradient search methods , 1987, Comput. Oper. Res..
[70] Clyde L. Monma,et al. Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..
[71] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[72] Robert E. Tarjan,et al. One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..
[73] Mark H. Karwan,et al. A Lagrangean dual-based solution method for a special linear programming problem , 1987, Comput. Oper. Res..
[74] J. A. Hoogeveen,et al. Scheduling around a small common due date , 1991 .
[75] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .
[76] Yih-Long Chang,et al. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .