Problems, Algorithms and Complexity
暂无分享,去创建一个
Alessandro Agnetis | Jean-Charles Billaut | Stanisław Gawiejnowicz | Dario Pacciarelli | Ameur Soukhal | D. Pacciarelli | A. Agnetis | A. Soukhal | J. Billaut | Stanisław Gawiejnowicz
[1] T. C. Edwin Cheng,et al. Multi-agent scheduling on a single machine with max-form criteria , 2008, Eur. J. Oper. Res..
[2] Gur Mosheiov,et al. Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..
[3] Joseph Y.-T. Leung,et al. Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness , 2007, Eur. J. Oper. Res..
[4] Nguyen Huynh Tuong. Complexité et algorithmes pour l'ordonnancement multicritère des travaux indépendants : problèmes juste-à-temps et travaux interférants. , 2009 .
[5] Weiping Shang,et al. A note on the scheduling with two families of jobs , 2005, J. Sched..
[6] G. Nemhauser,et al. Integer Programming , 2020 .
[7] Lixin Tang,et al. Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine , 2008, COCOON.
[8] George L. Vairaktarakis,et al. Complexity of Single Machine Hierarchical Scheduling: A Survey , 1993 .
[9] Gerd Finke,et al. Flowshop scheduling problem with a batching machine and task compatibilities , 2009, Comput. Oper. Res..
[10] Joseph Y.-T. Leung,et al. Complexity of two dual criteria scheduling problems , 2007, Oper. Res. Lett..
[11] Sartaj Sahni,et al. Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..
[12] David Alcaide López de Pablo,et al. Network flow approaches to pre-emptive open-shop scheduling problems with time-windows , 2006, Eur. J. Oper. Res..
[13] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[14] Béla Bollobás,et al. Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93] , 1997 .
[15] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[16] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.
[17] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[18] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[19] Gerd Finke,et al. Scheduling a no-wait flow shop containing unbounded batching machines , 2005 .
[20] Gur Mosheiov,et al. Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..
[21] Joseph Y.-T. Leung,et al. Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..
[22] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .
[23] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[24] Flávio Sanson Fogliatto,et al. Learning curve models and applications: Literature review and research directions , 2011 .
[25] Hans Kellerer,et al. Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications , 2010, Algorithmica.
[26] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .
[27] Shijie Sun,et al. Single-Machine Scheduling Problems with Two Agents Competing for Makespan , 2010, LSMS/ICSEE.
[28] T. C. Edwin Cheng,et al. A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations , 2011, Comput. Ind. Eng..
[29] Eugeniusz Nowicki,et al. A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..
[30] Maurice Queyranne,et al. Structure of a simple scheduling polyhedron , 1993, Math. Program..
[31] Stanislaw Gawiejnowicz,et al. Conjugate problems in time-dependent scheduling , 2009, J. Sched..
[32] Michele Flammini,et al. Minimum Flow Time Graph Ordering , 2003, WG.
[33] Dirk Biskup,et al. A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..
[34] Stanislaw Gawiejnowicz,et al. A New Library for Evolutionary Algorithms , 2005, PPAM.
[35] Chin-Chia Wu,et al. An investigation on a two-agent single-machine scheduling problem with unequal release dates , 2012, Comput. Oper. Res..
[36] Joseph Y.-T. Leung,et al. Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..
[37] Lixin Tang,et al. Two-agent group scheduling with deteriorating jobs on a single machine , 2010 .
[38] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[39] Gur Mosheiov,et al. Single machine batch scheduling with two competing agents to minimize total flowtime , 2011, Eur. J. Oper. Res..
[40] Reinhard Männer,et al. Bicriterion scheduling of identical processing time jobs by uniform processors , 1995, Proceedings of 9th International Parallel Processing Symposium.
[41] Chin-Chia Wu,et al. A tabu method for a two-agent single-machine scheduling with deterioration jobs , 2013, Comput. Oper. Res..
[42] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[43] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[44] Alexander V. Kononov,et al. Scheduling Problems with Linear Increasing Processing Times , 1997 .
[45] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[46] Dvir Shabtay,et al. A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..
[47] P. Liu,et al. Two-agent single-machine scheduling problems under increasing linear deterioration , 2011 .
[48] Jean-Charles Billaut,et al. Solving multi-agent scheduling problems on parallel machines with a global objective function , 2014, RAIRO Oper. Res..
[49] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[50] T. C. Edwin Cheng,et al. A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..
[51] Jonathan Cole Smith,et al. A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..
[52] Joseph Y.-T. Leung,et al. Minimizing the Weighted Number of Tardy Task Units , 1994, Discret. Appl. Math..
[53] Ameur Soukhal,et al. Two-Agent Scheduling on an Unbounded Serial Batching Machine , 2012, ISCO.
[54] A. Agnetis,et al. Computing the Nash solution for scheduling bargaining problems , 2009 .
[55] Ameur Soukhal,et al. Two-agent scheduling with agent specific batches on an unbounded serial batching machine , 2014, Journal of Scheduling.
[56] Stanisław Gawiejnowicz,et al. NP-hard cases in scheduling deteriorating jobs on dedicated machines , 2001, J. Oper. Res. Soc..
[57] Jacek Blazewicz,et al. Handbook on Scheduling: From Theory to Applications , 2014 .
[58] Jon M. Peha,et al. Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time , 1995, Comput. Oper. Res..
[59] P. Pardalos. Complexity in numerical optimization , 1993 .
[60] Gur Mosheiov,et al. Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..
[61] Vitaly A. Strusevich,et al. Simple matching vs linear assignment in scheduling models with positional effects: A critical review , 2012, Eur. J. Oper. Res..
[62] Lothar Thiele,et al. Quality Assessment of Pareto Set Approximations , 2008, Multiobjective Optimization.
[63] Emmanuel Neron,et al. An unrelated parallel machines model for an industrial production resetting problem , 2008 .
[64] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[65] Ling-Huey Su,et al. Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints , 2009 .
[66] Eugene L. Lawler,et al. Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .
[67] Bertrand M. T. Lin,et al. A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..
[68] P Dileepan,et al. Bicriterion static scheduling research for a single machine , 1988 .
[69] Chin-Chia Wu,et al. Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties , 2012, Inf. Sci..
[70] Chung-Yee Lee,et al. Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..
[71] Marco Laumanns,et al. An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..
[72] C. Plott,et al. A BINARY CONFLICT ASCENDING PRICE (BICAP) MECHANISM FOR THE DECENTRALIZED ALLOCATION OF THE RIGHT TO USE RAILROAD TRACKS. , 1996 .
[73] Reha Uzsoy,et al. MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE , 1997 .
[74] Stanislaw Gawiejnowicz,et al. Isomorphic scheduling problems , 2012, Annals of Operations Research.
[75] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .
[76] Snow Gb,et al. Incisions for neck dissection and laryngectomy. , 1974 .
[77] T. C. Edwin Cheng,et al. Two-agent single-machine scheduling with assignable due dates , 2012, Appl. Math. Comput..
[78] Lizhen Shao,et al. An approximation algorithm for convex multi-objective programming problems , 2011, J. Glob. Optim..
[79] B. J. Lageweg,et al. Scheduling identical jobs on uniform parallel machines , 1989 .
[80] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .
[81] Peter Brucker,et al. Single machine batch scheduling to minimize the weighted number of late jobs , 1996, Math. Methods Oper. Res..
[82] Qi Feng,et al. A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives , 2013 .
[83] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[84] A. R. Meyer,et al. Handbook of Theoretical Computer Science: Algorithms and Complexity , 1990 .
[85] Alessandro Agnetis,et al. A Lagrangian approach to single-machine scheduling problems with two competing agents , 2009, J. Sched..
[86] Alessandro Agnetis,et al. Multi-agent single machine scheduling , 2007, Ann. Oper. Res..
[87] Eric Torng,et al. Mixed Criteria Packet Scheduling , 2007, AAIM.
[88] Bahram Alidaee,et al. Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..
[89] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[90] Harvey M. Wagner,et al. An integer linear‐programming model for machine scheduling , 1959 .
[91] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[92] T.C.E. Cheng,et al. Single machine batch scheduling with sequential job processing , 2001 .
[93] Hiroaki Ishii,et al. Bi-criteria scheduling problem on three identical parallel machines , 1999 .
[94] Chung-Lun Li,et al. Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard , 2001, Inf. Process. Lett..
[95] Susanne Albers,et al. The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..
[96] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[97] T. C. Edwin Cheng,et al. Two-agent scheduling to minimize the total cost , 2011, Eur. J. Oper. Res..
[98] Denis Trystram,et al. Multi-users scheduling in parallel systems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[99] Joseph Y.-T. Leung,et al. Minimizing Schedule Length Subject to Minimum Flow Time , 1989, SIAM J. Comput..
[100] Yu-Hsiang Chung,et al. Genetic algorithms for a two-agent single-machine problem with release time , 2012, Appl. Soft Comput..
[101] Ahmet B. Keha,et al. Single machine scheduling with interfering job sets , 2014, Comput. Oper. Res..
[102] Jinjiang Yuan,et al. Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan , 2007, Theor. Comput. Sci..
[103] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[104] Arthur M. Geoffrion,et al. Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.
[105] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[106] Gerhard J. Woeginger,et al. The constrained minimum weighted sum of job completion times problem , 2004, Math. Program..
[107] Hua-Ping Chen,et al. Two-agent scheduling on a single batch processing machine with non-identical job sizes , 2011, 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC).
[108] Dorit S. Hochbaum,et al. Scheduling with batching: minimizing the weighted number of tardy jobs , 1994, Oper. Res. Lett..
[109] Weiping Shang,et al. Pareto optimization of serial-batching scheduling problems on two agents , 2011, The 2011 International Conference on Advanced Mechatronic Systems.
[110] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[111] Chin-Chia Wu,et al. Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations , 2012, J. Intell. Manuf..
[112] Han Hoogeveen,et al. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time , 1994, Oper. Res. Lett..
[113] Wen-Hung Wu,et al. AN EXACT AND META-HEURISTIC APPROACH FOR TWO-AGENT SINGLE-MACHINE SCHEDULING PROBLEM , 2013 .
[114] Gerhard J. Woeginger,et al. Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.
[115] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[116] Wen-Chiung Lee,et al. A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .
[117] Alessandro Agnetis,et al. Two Agents Competing for a Shared Machine , 2013, ADT.
[118] Ahmet B. Keha,et al. Scheduling interfering job sets on parallel machines , 2009, Eur. J. Oper. Res..
[119] Kenneth R. Baker,et al. Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..
[120] Adam Janiak,et al. Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..
[121] Chin-Chia Wu,et al. A study of the single-machine two-agent scheduling problem with release times , 2013, Appl. Soft Comput..
[122] T. C. Edwin Cheng,et al. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..
[123] George Mavrotas,et al. Effective implementation of the epsilon-constraint method in Multi-Objective Mathematical Programming problems , 2009, Appl. Math. Comput..
[124] Moshe Dror,et al. Agent-based project scheduling , 2000 .
[125] Gerd Finke,et al. Graph Partitioning and Set Covering for the Optimal Design of a Production System in the Metal Industry , 2000 .
[126] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[127] Zhi-Long Chen. Parallel Machine Scheduling with Time Dependent Processing Times , 1996, Discret. Appl. Math..
[128] T. C. Edwin Cheng,et al. Two-agent singe-machine scheduling with release times to minimize the total weighted completion time , 2013, Comput. Oper. Res..
[129] R. G. Vickson,et al. Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..
[130] Adam Janiak,et al. Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..
[131] Na Yi,et al. Scheduling two agents with sum-of-processing-times-based deterioration on a single machine , 2013, Appl. Math. Comput..
[132] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[133] Donatas Elvikis,et al. Two-agent scheduling on uniform parallel machines with min-max criteria , 2012, Annals of Operations Research.
[134] Alessandro Agnetis,et al. Scheduling Problems with Two Competing Agents , 2004, Oper. Res..
[135] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[136] Mihalis Yannakakis,et al. Batch sizing and job sequencing on a single machine , 1991 .
[137] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[138] Ludo Gelders,et al. Solving a bicriterion scheduling problem , 1980 .
[139] Alan S. Manne,et al. On the Job-Shop Scheduling Problem , 1960 .
[140] Byung-Cheon Choi,et al. Approximation algorithms for multi-agent scheduling to minimize total weighted completion time , 2009, Inf. Process. Lett..
[141] Xiwen Lu,et al. Approximation schemes for two-agent scheduling on parallel machines , 2013, Theor. Comput. Sci..
[142] Eugene L. Lawler,et al. Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .
[143] S. Ruzika,et al. Approximation Methods in Multiobjective Programming , 2005 .
[144] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[145] E. H. Bowman. THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .
[146] Han Hoogeveen,et al. Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria , 1996, J. Algorithms.
[147] Stanislaw Gawiejnowicz,et al. Equivalent time-dependent scheduling problems , 2009, Eur. J. Oper. Res..
[148] Long Wan,et al. A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints , 2015, J. Sched..
[149] T. C. Edwin Cheng,et al. The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan , 2004, Oper. Res. Lett..
[150] W. A. Horn. Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..
[151] F. Jolai,et al. Optimal methods for batch processing problem with makespan and maximum lateness objectives , 2010 .
[152] T. C. Edwin Cheng,et al. Two-agent scheduling with position-based deteriorating jobs and learning effects , 2011, Appl. Math. Comput..
[153] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .
[154] Lixin Tang,et al. Two-agent single-machine scheduling with position-dependent processing times , 2010 .
[155] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[156] Der-Chiang Li,et al. Solving a two-agent single-machine scheduling problem considering learning effect , 2012, Comput. Oper. Res..
[157] R. Bellman. Dynamic programming. , 1957, Science.
[158] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[159] Art Lew,et al. Dynamic Programming: A Computational Tool , 2006 .
[160] Jinjiang Yuan,et al. Unbounded parallel-batching scheduling with two competitive agents , 2012, J. Sched..
[161] J. A. Hoogeveen,et al. Scheduling a batching machine , 1998 .
[162] Wen-Chiung Lee,et al. Two-agent scheduling with learning consideration , 2011, Comput. Ind. Eng..
[163] Chin-Chia Wu,et al. Single-machine scheduling of proportionally deteriorating jobs by two agents , 2011, J. Oper. Res. Soc..
[164] William L. Maxwell,et al. Theory of scheduling , 1967 .
[165] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[166] Joanna Józefowska,et al. Just-in-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems , 2007 .
[167] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[168] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[169] Jean-Charles Billaut,et al. Single-machine multi-agent scheduling problems with a global objective function , 2011, Journal of Scheduling.
[170] Horst W. Hamacher,et al. Scheduling two agents on uniform parallel machines with makespan and cost functions , 2011, J. Sched..
[171] S. L. van de Velde,et al. Machine scheduling and Lagrangian relaxation , 1991 .
[172] Evripidis Bampis,et al. Approximation results for a bicriteria job scheduling problem on a single machine without preemption , 2005, Inf. Process. Lett..
[173] T.C.E. Cheng,et al. Batching in a two-stage flowshop with dedicated machines in the second stage , 2004 .
[174] A. Nagar,et al. Multiple and bicriteria scheduling : A literature survey , 1995 .
[175] Chris N. Potts,et al. Scheduling batches with simultaneous job processing for two-machine shop problems , 2001 .
[176] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[177] E. L. Lawler,et al. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .