skip to main content
Skip header Section
Scheduling: Theory, Algorithms, and SystemsJuly 2008
Publisher:
  • Springer Publishing Company, Incorporated
ISBN:978-0-387-78934-7
Published:24 July 2008
Pages:
678
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems. The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments. Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University.

Cited By

  1. Cavazos-Cadena R, Cruz-Suárez H and Montes-De-Oca R (2023). Average criteria in denumerable semi-Markov decision chains under risk-aversion, Discrete Event Dynamic Systems, 33:3, (221-256), Online publication date: 1-Sep-2023.
  2. ACM
    Baioletti M, Oddi A and Rasconi R Solving Scheduling Problems with Quantum Computing: a Study on Flexible Open Shop Proceedings of the Companion Conference on Genetic and Evolutionary Computation, (2175-2178)
  3. Ɖurasević M and Jakobović D (2023). Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey, Artificial Intelligence Review, 56:4, (3181-3289), Online publication date: 1-Apr-2023.
  4. Levorato M, Sotelo D, Figueiredo R and Frota Y (2023). Robust permutation flow shop total weighted completion time problem, Computers and Operations Research, 151:C, Online publication date: 1-Mar-2023.
  5. An Y, Chen X, Gao K, Zhang L, Li Y and Zhao Z (2023). A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance, Expert Systems with Applications: An International Journal, 212:C, Online publication date: 1-Feb-2023.
  6. Cherif G, Leclercq E and Lefebvre D (2023). Scheduling of a class of partial routing FMS in uncertain environments with beam search, Journal of Intelligent Manufacturing, 34:2, (493-514), Online publication date: 1-Feb-2023.
  7. Chiang R (2023). Contention-aware container placement strategy for docker swarm with machine learning based clustering algorithms, Cluster Computing, 26:1, (13-23), Online publication date: 1-Feb-2023.
  8. Wang J, Song G, Liang Z, Demeulemeester E, Hu X and Liu J (2023). Unrelated parallel machine scheduling with multiple time windows, Computers and Operations Research, 149:C, Online publication date: 1-Jan-2023.
  9. Maecker S, Shen L and Mönch L (2023). Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, Computers and Operations Research, 149:C, Online publication date: 1-Jan-2023.
  10. Wang S, Wu R, Chu F and Yu J (2023). An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times, Computers and Industrial Engineering, 175:C, Online publication date: 1-Jan-2023.
  11. ACM
    Fresa A and Champati J An Offloading Algorithm for Maximizing Inference Accuracy on Edge Device in an Edge Intelligence System Proceedings of the 25th International ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems, (15-23)
  12. Noyan N, Rudolf G and Lejeune M (2022). Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics, INFORMS Journal on Computing, 34:2, (729-751), Online publication date: 1-Mar-2022.
  13. Daneshdoost F, Hajiaghaei-Keshteli M, Sahin R and Niroomand S (2022). Tabu Search Based Hybrid Meta-Heuristic Approaches for Schedule-Based Production Cost Minimization Problem for the Case of Cable Manufacturing Systems, Informatica, 33:3, (499-522), Online publication date: 1-Jan-2022.
  14. Nahhas A, Kharitonov A, Alwadi A and Turowski K (2022). Hybrid Approach for Solving Multi-Objective Hybrid Flow Shop Scheduling Problems with Family Setup Times, Procedia Computer Science, 200:C, (1685-1694), Online publication date: 1-Jan-2022.
  15. Koulamas C and Kyparisis G (2022). Flow shop scheduling with two distinct job due dates, Computers and Industrial Engineering, 163:C, Online publication date: 1-Jan-2022.
  16. Ghasemi A and Heavey C An evaluation of strategies for job mix selection in job shop production environments - case Proceedings of the Winter Simulation Conference, (1-12)
  17. Laroque C, Leißau M, Copado P, Panadero J, Juan A and Schumacher C A biased-randomized discrete-event heuristic for the hybrid flow shop problem with batching and multiple paths Proceedings of the Winter Simulation Conference, (1-11)
  18. Pirozmand P, Hosseinabadi A, Farrokhzad M, Sadeghilalimi M, Mirkamali S and Slowik A (2021). Multi-objective hybrid genetic algorithm for task scheduling problem in cloud computing, Neural Computing and Applications, 33:19, (13075-13088), Online publication date: 1-Oct-2021.
  19. Wagle S and Paranjape A Use of simulation-aided reinforcement learning for optimal scheduling of operations in industrial plants Proceedings of the Winter Simulation Conference, (572-583)
  20. Türkyılmaz A, Şenvar Ö, Ünal İ and Bulkan S (2020). A research survey: heuristic approaches for solving multi objective flexible job shop problems, Journal of Intelligent Manufacturing, 31:8, (1949-1983), Online publication date: 1-Dec-2020.
  21. ACM
    Purbo T and Kurniawan T Survey of automated meeting scheduling approaches Proceedings of the 5th International Conference on Sustainable Information Engineering and Technology, (29-34)
  22. Kuchumov R and Korkhov V Collecting HPC Applications Processing Characteristics to Facilitate Co-scheduling Computational Science and Its Applications – ICCSA 2020, (168-182)
  23. ACM
    K G and Komarudin Development of NEH for Permutation Flowshop Scheduling Problem Proceedings of the 3rd Asia Pacific Conference on Research in Industrial and Systems Engineering, (278-283)
  24. Wang S, Wu R, Chu F and Yu J (2019). Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:12, (8917-8936), Online publication date: 1-Jun-2020.
  25. Bendotti P, Chrétienne P, Fouilhoux P and Pass-Lanneau A Anchored Rescheduling Problems Under Generalized Precedence Constraints Combinatorial Optimization, (156-166)
  26. Dulebenets M (2020). Archived elitism in evolutionary computation, International Journal of Bio-Inspired Computation, 15:3, (135-146), Online publication date: 1-Jan-2020.
  27. Naghshnejad M and Singhal M (2019). A hybrid scheduling platform: a runtime prediction reliability aware scheduling platform to improve HPC scheduling performance, The Journal of Supercomputing, 76:1, (122-149), Online publication date: 1-Jan-2020.
  28. Salehi Mir M, Rezaeian J and Mohamadian H (2019). Scheduling parallel machine problem under general effects of deterioration and learning with past-sequence-dependent setup time: heuristic and meta-heuristic approaches, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:2, (1335-1355), Online publication date: 1-Jan-2020.
  29. ACM
    Clinch S, Mikusz M, Elhart I, Davies N and Langheinrich M (2020). Scheduling Content in Pervasive Display Systems, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 3:4, (1-37), Online publication date: 11-Dec-2019.
  30. Lamorgese L and Mannino C (2019). A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Operations Research, 67:6, (1586-1609), Online publication date: 1-Nov-2019.
  31. Kasperski A and Zieliński P (2019). Risk-averse single machine scheduling: complexity and approximation, Journal of Scheduling, 22:5, (567-580), Online publication date: 1-Oct-2019.
  32. ACM
    Gainaru A, Aupy G, Sun H and Raghavan P Speculative Scheduling for Stochastic HPC Applications Proceedings of the 48th International Conference on Parallel Processing, (1-10)
  33. ACM
    Wang Y, Tari Z, Huang X and Zomaya A A Network-aware and Partition-based Resource Management Scheme for Data Stream Processing Proceedings of the 48th International Conference on Parallel Processing, (1-10)
  34. Benmansour R, Braun O and Hanafi S (2019). The single-processor scheduling problem with time restrictions, Journal of Scheduling, 22:4, (465-471), Online publication date: 1-Aug-2019.
  35. Gong W, Yan J, Nan X and Tie Y (2019). Joint optimization of routing and VM resource allocation for multimedia cloud, Multimedia Systems, 25:4, (355-369), Online publication date: 1-Aug-2019.
  36. Kumar H, Kumar P and Sharma M (2020). Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm, International Journal of Applied Logistics, 9:2, (20-38), Online publication date: 1-Jul-2019.
  37. Fu Y, Wang H, Tian G, Li Z and Hu H (2019). Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm, Journal of Intelligent Manufacturing, 30:5, (2257-2272), Online publication date: 1-Jun-2019.
  38. ACM
    Delmas Lascorz A, Judd P, Stuart D, Poulos Z, Mahmoud M, Sharify S, Nikolic M, Siu K and Moshovos A Bit-Tactical Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, (749-763)
  39. Zekrizadeh N, Khademzadeh A and Hosseinzadeh M (2019). An Online Cost-Based Job Scheduling Method by Cellular Automata in Cloud Computing Environment, Wireless Personal Communications: An International Journal, 105:3, (913-939), Online publication date: 1-Apr-2019.
  40. Dang Q, Nguyen C and Rudová H (2019). Scheduling of mobile robots for transportation and manufacturing tasks, Journal of Heuristics, 25:2, (175-213), Online publication date: 1-Apr-2019.
  41. Fatima S and Wooldridge M (2019). Computing optimal coalition structures in polynomial time, Autonomous Agents and Multi-Agent Systems, 33:1-2, (35-83), Online publication date: 1-Mar-2019.
  42. Niebles-Atencio F, Rojas-Santiago M and Mendoza-Casseres D Multi-objective Evolutionary Approaches for Solving the Hybrid Flowshop Scheduling Problem Computer Aided Systems Theory – EUROCAST 2019, (446-453)
  43. Bandi C, Trichakis N and Vayanos P (2019). Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems, Management Science, 65:1, (152-187), Online publication date: 1-Jan-2019.
  44. Tamssaouet K, Dauzère-Pérès S, Yugma C, Knopp S and Pinaton J A study on the integration of complex machines in complex job shop scheduling Proceedings of the 2018 Winter Simulation Conference, (3561-3572)
  45. Morrice D, Bard J, Mehta H, Sahoo S, Arunachalam N and Venkatraman P Using simulation to design a worklife integrated practice unit Proceedings of the 2018 Winter Simulation Conference, (2624-2635)
  46. ACM
    Dianawati F and Deliputri L Destination and Number of Flight Determination Using Multi Objective Goal Programming and Integer Linear Programming Proceedings of the 4th International Conference on Industrial and Business Engineering, (60-64)
  47. Nedaei M (2018). Scheduling Analysis and Strategic Service Planning for Optimum Operation of Two Parallel Machines Under Effect of Sequencing, International Journal of Service Science, Management, Engineering, and Technology, 9:4, (57-72), Online publication date: 1-Oct-2018.
  48. Jäntsch M, Nandola N, Wang L, Hakenberg M and Münz U Enhanced branch and bound approach for receding horizon based planning 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), (160-163)
  49. Li W and Zhang Z Balancing Trade-offs between Utilization and Work-in-Process Inventory Levels in Flow Shop Production 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), (1257-1262)
  50. Waschneck B, Altenmüller T, Bauernhansl T and Kyek A Case Study on Operator Compliance to Scheduling Decisions in Semiconductor Manufacturing 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), (649-652)
  51. Wang F, Lu Y and Ju F Condition-based Real-time Production Control for Smart Manufacturing Systems 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), (1052-1057)
  52. ACM
    Schreiber E, Korf R and Moffitt M (2018). Optimal Multi-Way Number Partitioning, Journal of the ACM, 65:4, (1-61), Online publication date: 16-Aug-2018.
  53. ACM
    Pontrakul C and Jarumaneeroj P Heuristic Based Scheduling for Tablets Film Coating Process Proceedings of the 2nd International Conference on Algorithms, Computing and Systems, (238-242)
  54. De Weerdt M, Albert M, Conitzer V and Van Der Linden K Complexity of scheduling charging in the smart grid Proceedings of the 27th International Joint Conference on Artificial Intelligence, (4736-4742)
  55. ACM
    Zamuda A, Nicolau M and Zarges C A black-box discrete optimization benchmarking (BB-DOB) pipeline survey Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1777-1782)
  56. ACM
    Romero M, García E, Ponsich A and Gutiérrez R A heuristic algorithm based on tabu search for the solution of flexible job shop scheduling problems with lot streaming Proceedings of the Genetic and Evolutionary Computation Conference, (285-292)
  57. Shao W, Pi D and Shao Z (2018). A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion, Computers and Operations Research, 94:C, (89-105), Online publication date: 1-Jun-2018.
  58. źUrasević M and Jakobović D (2018). Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment, Genetic Programming and Evolvable Machines, 19:1-2, (9-51), Online publication date: 1-Jun-2018.
  59. Chatterjee A, Borokhovich M, Varshney L, Vishwanath S, Varshney L, Chatterjee A, Vishwanath S and Borokhovich M (2018). Efficient and Flexible Crowdsourcing of Specialized Tasks With Precedence Constraints, IEEE/ACM Transactions on Networking, 26:2, (879-892), Online publication date: 1-Apr-2018.
  60. Pessoa B, Aloise D and Cabral L (2018). The Weighted Fair Sequences Problem, Computers and Operations Research, 91:C, (121-131), Online publication date: 1-Mar-2018.
  61. Srinivasa C, Givoni I, Ravanbakhsh S and Frey B Min-max propagation Proceedings of the 31st International Conference on Neural Information Processing Systems, (5571-5579)
  62. Winkler T and Sprenger R Simulation-based performance assessment of an implant scheduler in semiconductor manufacturing Proceedings of the 2017 Winter Simulation Conference, (1-10)
  63. Klemmt A, Kutschke J and Schubert C From dispatching to scheduling Proceedings of the 2017 Winter Simulation Conference, (1-12)
  64. Wu Q, Ishikawa F, Zhu Q, Xia Y and Wen J (2017). Deadline-Constrained Cost Optimization Approaches for Workflow Scheduling in Clouds, IEEE Transactions on Parallel and Distributed Systems, 28:12, (3401-3412), Online publication date: 1-Dec-2017.
  65. ACM
    Carastan-Santos D and de Camargo R Obtaining dynamic scheduling policies with simulation and machine learning Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-13)
  66. Wei W, Li H and Leus R (2017). Test sequencing for sequential system diagnosis with precedence constraints and imperfect tests, Decision Support Systems, 103:C, (104-116), Online publication date: 1-Nov-2017.
  67. Boejko W, Gnatowski A, Pempera J and Wodecki M (2017). Parallel tabu search for the cyclic job shop scheduling problem, Computers and Industrial Engineering, 113:C, (512-524), Online publication date: 1-Nov-2017.
  68. Yuce B, Fruggiero F, Packianather M, Pham D, Mastrocinque E, Lambiase A and Fera M (2017). Hybrid Genetic Bees Algorithm applied to single machine scheduling with earliness and tardiness penalties, Computers and Industrial Engineering, 113:C, (842-858), Online publication date: 1-Nov-2017.
  69. Touat M, Bouzidi-Hassini S, Benbouzid-Sitayeb F and Benhamou B (2017). A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints, Applied Soft Computing, 59:C, (556-573), Online publication date: 1-Oct-2017.
  70. ACM
    Du Y and Veciana G (2017). Scheduling for Cloud-Based Computing Systems to Support Soft Real-Time Applications, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2:3, (1-30), Online publication date: 30-Sep-2017.
  71. Benbouzid-Si Tayeb F, Bessedik M, Benbouzid M, Cheurfi H and Blizak A (2017). Research on Permutation Flow-shop Scheduling Problem based on Improved Genetic Immune Algorithm with vaccinated offspring, Procedia Computer Science, 112:C, (427-436), Online publication date: 1-Sep-2017.
  72. Abedinnia H, Glock C, Grosse E and Schneider M (2017). Machine scheduling problems in production, Computers and Industrial Engineering, 111:C, (403-416), Online publication date: 1-Sep-2017.
  73. Sterna M and Czerniachowska K (2017). Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work, Journal of Optimization Theory and Applications, 174:3, (927-944), Online publication date: 1-Sep-2017.
  74. Ware S and Su R Time optimal synthesis based upon sequential abstraction and maximizing parallelism 2017 13th IEEE Conference on Automation Science and Engineering (CASE), (926-931)
  75. Varakantham P and Fu N Mechanism design for strategic project scheduling Proceedings of the 26th International Joint Conference on Artificial Intelligence, (4433-4439)
  76. Huang R and Yu T (2017). An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting, Applied Soft Computing, 57:C, (642-656), Online publication date: 1-Aug-2017.
  77. Rudek R (2017). Parallel machine scheduling with general sum of processing time based models, Journal of Global Optimization, 68:4, (799-814), Online publication date: 1-Aug-2017.
  78. ACM
    Karunakaran D, Mei Y, Chen G and Zhang M Toward evolving dispatching rules for dynamic job shop scheduling under uncertainty Proceedings of the Genetic and Evolutionary Computation Conference, (282-289)
  79. Jos Palacios J, Gonzlez-Rodrguez I, Vela C and Puente J (2017). Robust multiobjective optimisation for fuzzy job shop problems, Applied Soft Computing, 56:C, (604-616), Online publication date: 1-Jul-2017.
  80. Pan Q, Gao L, Li X and Gao K (2017). Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Applied Mathematics and Computation, 303:C, (89-112), Online publication date: 15-Jun-2017.
  81. Geyik F and Elibal K (2017). A linguistic approach to non-identical parallel processor scheduling with fuzzy processing times, Applied Soft Computing, 55:C, (63-71), Online publication date: 1-Jun-2017.
  82. ACM
    Gianniti E, Rizzi A, Barbierato E, Gribaudo M and Ardagna D (2017). Fluid Petri Nets for the Performance Evaluation of MapReduce and Spark Applications, ACM SIGMETRICS Performance Evaluation Review, 44:4, (23-36), Online publication date: 10-May-2017.
  83. ACM
    Huang J, Mozafari B, Schoenebeck G and Wenisch T A Top-Down Approach to Achieving Performance Predictability in Database Systems Proceedings of the 2017 ACM International Conference on Management of Data, (745-758)
  84. Panwalkar S and Koulamas C (2017). On the dominance of permutation schedules for some ordered and proportionate flow shop problems, Computers and Industrial Engineering, 107:C, (105-108), Online publication date: 1-May-2017.
  85. Jiang D, Tan J and Li B (2017). Order acceptance and scheduling with batch delivery, Computers and Industrial Engineering, 107:C, (100-104), Online publication date: 1-May-2017.
  86. Torkashvand M, Naderi B and Hosseini S (2017). Modelling and scheduling multi-objective flow shop problems with interfering jobs, Applied Soft Computing, 54:C, (221-228), Online publication date: 1-May-2017.
  87. El Khoukhi F, Boukachour J and El Hilali Alaoui A (2017). The Dual-Ants Colony, Computers and Industrial Engineering, 106:C, (236-255), Online publication date: 1-Apr-2017.
  88. Zhang Y, Shen S and Erdogan S (2017). Distributionally robust appointment scheduling with moment-based ambiguity set, Operations Research Letters, 45:2, (139-144), Online publication date: 1-Mar-2017.
  89. Aziz H, Rauchecker G, Schryen G and Walsh T Algorithms for max-min share fair allocation of indivisible chores Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (335-341)
  90. Tokola H, Niemi E and Kyrenius P (2017). How Lean transformation affects scheduling, Robotics and Computer-Integrated Manufacturing, 43:C, (171-178), Online publication date: 1-Feb-2017.
  91. Sadi F and Soukhal A (2017). Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs, Discrete Optimization, 23:C, (93-104), Online publication date: 1-Feb-2017.
  92. Moons S, Ramaekers K, Caris A and Arda Y (2017). Integrating production scheduling and vehicle routing decisions at the operational decision level, Computers and Industrial Engineering, 104:C, (224-245), Online publication date: 1-Feb-2017.
  93. Im S and Moseley B Fair scheduling via iterative quasi-uniform sampling Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (2601-2615)
  94. Zhang R, Chang P, Song S and Wu C (2017). A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes, Knowledge-Based Systems, 116:C, (114-129), Online publication date: 15-Jan-2017.
  95. Plitsos S, Repoussis P, Mourtos I and Tarantilis C (2017). Energy-aware decision support for production scheduling, Decision Support Systems, 93:C, (88-97), Online publication date: 1-Jan-2017.
  96. Fernandez-Viagas V and Framinan J (2017). Reduction of permutation flowshop problems to single machine problems using machine dominance relations, Computers and Operations Research, 77:C, (96-110), Online publication date: 1-Jan-2017.
  97. Zheng X and Wang L (2016). A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints, Expert Systems with Applications: An International Journal, 65:C, (28-39), Online publication date: 15-Dec-2016.
  98. Aurich P, Nahhas A, Reggelin T and Tolujew J Simulation-based optimization for solving a hybrid flow shop scheduling problem Proceedings of the 2016 Winter Simulation Conference, (2809-2819)
  99. Senderovich A, Weidlich M, Yedidsion L, Gal A, Mandelbaum A, Kadish S and Bunnell C (2016). Conformance checking and performance improvement in scheduled processes, Information Systems, 62:C, (185-206), Online publication date: 1-Dec-2016.
  100. Yang C, Lin B, Hwang F and Wang M (2016). Acquisition planning and scheduling of computing resources, Computers and Operations Research, 76:C, (167-182), Online publication date: 1-Dec-2016.
  101. Cavazos-Cadena R (2016). A poisson equation for the risk-sensitive average cost in semi-markov chains, Discrete Event Dynamic Systems, 26:4, (633-656), Online publication date: 1-Dec-2016.
  102. Mirshekarian S and Šormaz D (2016). Correlation of job-shop scheduling problem features with scheduling efficiency, Expert Systems with Applications: An International Journal, 62:C, (131-147), Online publication date: 15-Nov-2016.
  103. Kogan D, Trukhina M, Fedosenko Y and Sheyanov A (2016). Models and optimization problems for single-processor servicing of packets of objects, Automation and Remote Control, 77:11, (1994-2005), Online publication date: 1-Nov-2016.
  104. Canon L and Jeannot E (2016). Correlation-Aware Heuristics for Evaluating the Distribution of the Longest Path Length of a DAG with Random Weights, IEEE Transactions on Parallel and Distributed Systems, 27:11, (3158-3171), Online publication date: 1-Nov-2016.
  105. Yoo J and Lee I (2016). Parallel machine scheduling with maintenance activities, Computers and Industrial Engineering, 101:C, (361-371), Online publication date: 1-Nov-2016.
  106. González-Neira E, García-Cáceres R, Caballero-Villalobos J, Molina-Sánchez L and Montoya-Torres J (2016). Stochastic flexible flow shop scheduling problem under quantitative and qualitative decision criteria, Computers and Industrial Engineering, 101:C, (128-144), Online publication date: 1-Nov-2016.
  107. Biel K and Glock C (2016). Systematic literature review of decision support models for energy-efficient production planning, Computers and Industrial Engineering, 101:C, (243-259), Online publication date: 1-Nov-2016.
  108. źurasević M, Jakobović D and Kneźević K (2016). Adaptive scheduling on unrelated machines with genetic programming, Applied Soft Computing, 48:C, (419-430), Online publication date: 1-Nov-2016.
  109. Abedinnia H, Glock C and Brill A (2016). New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem, Computers and Operations Research, 74:C, (165-174), Online publication date: 1-Oct-2016.
  110. Samudra M, Van Riet C, Demeulemeester E, Cardoen B, Vansteenkiste N and Rademakers F (2016). Scheduling operating rooms, Journal of Scheduling, 19:5, (493-525), Online publication date: 1-Oct-2016.
  111. Bock S (2016). Finding optimal tour schedules on transportation paths under extended time window constraints, Journal of Scheduling, 19:5, (527-546), Online publication date: 1-Oct-2016.
  112. Lu Y, Jin J, Ji P and Wang J (2016). Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine, Neural Computing and Applications, 27:7, (1993-2000), Online publication date: 1-Oct-2016.
  113. Liang X, Zhou W, Liu A and Xue H (2016). Collaborative Product Design for Tasks Sorting Based on Shortest Delivery, Scientific Programming, 2016, (13), Online publication date: 1-Sep-2016.
  114. Vélez-Gallego M, Maya J and Montoya-Torres J (2016). A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan, Computers and Operations Research, 73:C, (132-140), Online publication date: 1-Sep-2016.
  115. Lin S and Ying K (2016). Minimizing makespan for solving the distributed no-wait flowshop scheduling problem, Computers and Industrial Engineering, 99:C, (202-209), Online publication date: 1-Sep-2016.
  116. Borovica-Gajić R, Appuswamy R and Ailamaki A (2016). Cheap data analytics using cold storage devices, Proceedings of the VLDB Endowment, 9:12, (1029-1040), Online publication date: 1-Aug-2016.
  117. Michalska M, Zufferey N and Mattavelli M (2016). Performance Estimation Based Multicriteria Partitioning Approach for Dynamic Dataflow Programs, Journal of Electrical and Computer Engineering, 2016, (12), Online publication date: 1-Aug-2016.
  118. Lee W, Wang J and Lin M (2016). A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents, Knowledge-Based Systems, 105:C, (68-82), Online publication date: 1-Aug-2016.
  119. He J, Li Q and Xu D (2016). Scheduling two parallel machines with machine-dependent availabilities, Computers and Operations Research, 72:C, (31-42), Online publication date: 1-Aug-2016.
  120. Rahmani D and Ramezanian R (2016). A stable reactive approach in dynamic flexible flow shop scheduling with unexpected disruptions, Computers and Industrial Engineering, 98:C, (360-372), Online publication date: 1-Aug-2016.
  121. Karabulut K (2016). A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops, Computers and Industrial Engineering, 98:C, (300-307), Online publication date: 1-Aug-2016.
  122. Wang J, Chen J, Zhang Y and Huang G (2016). Schedule-based execution bottleneck identification in a job shop, Computers and Industrial Engineering, 98:C, (308-322), Online publication date: 1-Aug-2016.
  123. Ying K, Lu C and Chen J (2016). Exact algorithms for single-machine scheduling problems with a variable maintenance, Computers and Industrial Engineering, 98:C, (427-433), Online publication date: 1-Aug-2016.
  124. Chávez-Rodríguez S, Cavazos-Cadena R and Cruz-Suárez H (2016). Controlled Semi-Markov Chains with Risk-Sensitive Average Cost Criterion, Journal of Optimization Theory and Applications, 170:2, (670-686), Online publication date: 1-Aug-2016.
  125. Hall N, Leung J and Li C (2016). Multitasking via alternate and shared processing, Discrete Applied Mathematics, 208:C, (41-58), Online publication date: 31-Jul-2016.
  126. ACM
    Mei Y, Zhang M and Nyugen S Feature Selection in Evolving Job Shop Dispatching Rules with Genetic Programming Proceedings of the Genetic and Evolutionary Computation Conference 2016, (365-372)
  127. (2016). Improved auto control ant colony optimization using lazy ant approach for grid scheduling problem, Future Generation Computer Systems, 60:C, (78-89), Online publication date: 1-Jul-2016.
  128. Liu Z, Lee W and Wang J (2016). Resource consumption minimization with a constraint of maximum tardiness on parallel machines, Computers and Industrial Engineering, 97:C, (191-201), Online publication date: 1-Jul-2016.
  129. He H (2016). Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect, Computers and Industrial Engineering, 97:C, (73-83), Online publication date: 1-Jul-2016.
  130. Yu A and Seif J (2016). Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA, Computers and Industrial Engineering, 97:C, (26-40), Online publication date: 1-Jul-2016.
  131. Qiu Z, Stein C and Zhong Y Experimental Analysis of Algorithms for Coflow Scheduling Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685, (262-277)
  132. Shao W and Pi D (2016). A self-guided differential evolution with neighborhood search for permutation flow shop scheduling, Expert Systems with Applications: An International Journal, 51:C, (161-176), Online publication date: 1-Jun-2016.
  133. Kundakcı N and Kulak O (2016). Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem, Computers and Industrial Engineering, 96:C, (31-51), Online publication date: 1-Jun-2016.
  134. Liu T, Ma W, Qin T, Tang P, Yang G and Zheng B Online Non-Preemptive Story Scheduling in Web Advertising Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, (269-277)
  135. Drwal M and Rischke R (2016). Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion, Operations Research Letters, 44:3, (354-358), Online publication date: 1-May-2016.
  136. Bożejko W, Uchroński M and Wodecki M (2016). Parallel metaheuristics for the cyclic flow shop scheduling problem, Computers and Industrial Engineering, 95:C, (156-163), Online publication date: 1-May-2016.
  137. Kaplanoğlu V (2016). An object-oriented approach for multi-objective flexible job-shop scheduling problem, Expert Systems with Applications: An International Journal, 45:C, (71-84), Online publication date: 1-Mar-2016.
  138. Bai D, Zhang Z and Zhang Q (2016). Flexible open shop scheduling problem to minimize makespan, Computers and Operations Research, 67:C, (207-215), Online publication date: 1-Mar-2016.
  139. Branke J, Nguyen S, Pickardt C and Zhang M (2016). Automated Design of Production Scheduling Heuristics: A Review, IEEE Transactions on Evolutionary Computation, 20:1, (110-124), Online publication date: 1-Feb-2016.
  140. Li X, Jiang T and Ruiz R (2016). Heuristics for periodical batch job scheduling in a MapReduce computing framework, Information Sciences: an International Journal, 326:C, (119-133), Online publication date: 1-Jan-2016.
  141. Mladenovic S, Veskovic S, Branovic I, Jankovic S and Acimovic S (2016). Heuristic Based Real-Time Train Rescheduling System, Networks, 67:1, (32-48), Online publication date: 1-Jan-2016.
  142. Genez T, Pietri I, Sakellariou R, Bittencourt L and Madeira E A particle swarm optimization approach for workflow scheduling on cloud resources priced by CPU frequency Proceedings of the 8th International Conference on Utility and Cloud Computing, (237-241)
  143. Wang M and Zhou Y Scheduling for an automated guided vehicle in flexible machine systems Proceedings of the 2015 Winter Simulation Conference, (2908-2916)
  144. Williamson M and Subramani K (2015). On the negative cost girth problem in planar networks, Journal of Discrete Algorithms, 35:C, (40-50), Online publication date: 1-Nov-2015.
  145. Xiao J, Yang H, Zhang C, Zheng L and Gupta J (2015). A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, Computers and Operations Research, 63:C, (72-82), Online publication date: 1-Nov-2015.
  146. Xiao Y, Yuan Y, Zhang R and Konak A (2015). Non-permutation flow shop scheduling with order acceptance and weighted tardiness, Applied Mathematics and Computation, 270:C, (312-333), Online publication date: 1-Nov-2015.
  147. ACM
    Mann Z (2015). Allocation of Virtual Machines in Cloud Data Centers—A Survey of Problem Models and Optimization Algorithms, ACM Computing Surveys, 48:1, (1-34), Online publication date: 29-Sep-2015.
  148. Apeldoorn D A Spatio-Temporal Multiagent Simulation Framework for Reusing Agents in Different Kinds of Scenarios Revised Selected Papers of the 13th German Conference on Multiagent System Technologies - Volume 9433, (79-97)
  149. ACM
    Chu D, Zhang Z, Wolman A and Lane N Prime Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing, (203-214)
  150. Jiang S, Liu M, Hao J and Qian W (2015). A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry, Computers and Industrial Engineering, 87:C, (518-531), Online publication date: 1-Sep-2015.
  151. Huang J and Süer G (2015). A dispatching rule-based genetic algorithm for multi-objective job shop scheduling using fuzzy satisfaction levels, Computers and Industrial Engineering, 86:C, (29-42), Online publication date: 1-Aug-2015.
  152. Fernández Anta A, Georgiou C, Kowalski D and Zavou E (2015). Online parallel scheduling of non-uniform tasks, Theoretical Computer Science, 590:C, (129-146), Online publication date: 26-Jul-2015.
  153. ACM
    Agrawal P and Rao S Energy-Minimal Scheduling of Divisible Loads Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, (265-270)
  154. ACM
    Park J, Nguyen S, Zhang M and Johnston M A Single Population Genetic Programming based Ensemble Learning Approach to Job Shop Scheduling Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, (1451-1452)
  155. ACM
    Nguyen S, Zhang M and Tan K A Dispatching rule based Genetic Algorithm for Order Acceptance and Scheduling Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (433-440)
  156. ACM
    Nouri N and Ladhari T Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (441-448)
  157. ACM
    Kafshdooz M and Ejlali A (2015). Dynamic Shared SPM Reuse for Real-Time Multicore Embedded Systems, ACM Transactions on Architecture and Code Optimization, 12:2, (1-25), Online publication date: 8-Jul-2015.
  158. ACM
    Qiu Z, Stein C and Zhong Y Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, (294-303)
  159. Cohen K and Qing Zhao (2015). Asymptotically Optimal Anomaly Detection via Sequential Testing, IEEE Transactions on Signal Processing, 63:11, (2929-2941), Online publication date: 1-Jun-2015.
  160. Ding J, Song S, Gupta J, Zhang R, Chiong R and Wu C (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem, Applied Soft Computing, 30:C, (604-613), Online publication date: 1-May-2015.
  161. Hsieh P, Yang S and Yang D (2015). Decision support for unrelated parallel machine scheduling with discrete controllable processing times, Applied Soft Computing, 30:C, (475-483), Online publication date: 1-May-2015.
  162. Palacios J, González-Rodríguez I, Vela C and Puente J (2015). A particle swarm solution based on lexicographical goal programming for a multiobjective fuzzy open shop problem, AI Communications, 28:2, (239-257), Online publication date: 1-Apr-2015.
  163. González M, Vela C, Varela R and González-Rodríguez I (2015). An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups, AI Communications, 28:2, (179-193), Online publication date: 1-Apr-2015.
  164. Rubio-Montero A, Huedo E, Castejón F and Mayo-García R (2015). GWpilot, Future Generation Computer Systems, 45:C, (25-52), Online publication date: 1-Apr-2015.
  165. Cohen K and Qing Zhao (2015). Active Hypothesis Testing for Anomaly Detection, IEEE Transactions on Information Theory, 61:3, (1432-1450), Online publication date: 1-Mar-2015.
  166. Ma Z (2015). Towards computational models of animal cognition, an introduction for computer scientists, Cognitive Systems Research, 33:C, (42-69), Online publication date: 1-Mar-2015.
  167. Nasiri M (2015). A modified ABC algorithm for the stage shop scheduling problem, Applied Soft Computing, 28:C, (81-89), Online publication date: 1-Mar-2015.
  168. Gerstl E, Mor B and Mosheiov G (2015). A note, Information Processing Letters, 115:2, (159-162), Online publication date: 1-Feb-2015.
  169. Palacios J, González M, Vela C, González-Rodríguez I and Puente J (2015). Genetic tabu search for the fuzzy flexible job shop problem, Computers and Operations Research, 54:C, (74-89), Online publication date: 1-Feb-2015.
  170. Leisten R and Rajendran C (2015). Variability of completion time differences in permutation flow shop scheduling, Computers and Operations Research, 54:C, (155-167), Online publication date: 1-Feb-2015.
  171. Tekin C and Liu M (2015). Online Learning Methods for Networking, Foundations and Trends® in Networking, 8:4, (281-409), Online publication date: 15-Jan-2015.
  172. Cheng J, Fowler J, Kempf K and Mason S (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting, Computers and Operations Research, 53:C, (275-287), Online publication date: 1-Jan-2015.
  173. Nguyen S, Zhang M, Johnston M and Tan K Selection Schemes in Surrogate-Assisted Genetic Programming for Job Shop Scheduling Proceedings of the 10th International Conference on Simulated Evolution and Learning - Volume 8886, (656-667)
  174. ACM
    Maggio M, Terraneo F and Leva A (2014). Task scheduling, ACM Transactions on Embedded Computing Systems, 13:4, (1-22), Online publication date: 5-Dec-2014.
  175. ACM
    Wang W, Feng C, Li B and Liang B On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, (235-248)
  176. Behnamian J (2014). Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation, Computers and Operations Research, 52:PB, (181-191), Online publication date: 1-Dec-2014.
  177. Bilyk A, Mönch L and Almeder C (2014). Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics, Computers and Industrial Engineering, 78:C, (175-185), Online publication date: 1-Dec-2014.
  178. Azadeh A, Hosseinabadi Farahani M, Torabzadeh S and Baghersad M (2014). Scheduling prioritized patients in emergency department laboratories, Computer Methods and Programs in Biomedicine, 117:2, (61-70), Online publication date: 1-Nov-2014.
  179. Hosseini S and Al Khaled A (2014). A survey on the Imperialist Competitive Algorithm metaheuristic, Applied Soft Computing, 24:C, (1078-1094), Online publication date: 1-Nov-2014.
  180. Xu J, Yin Y, Cheng T, Wu C and Gu S (2014). A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan, Applied Soft Computing, 24:C, (277-283), Online publication date: 1-Nov-2014.
  181. ACM
    Hunt R, Johnston M and Zhang M Evolving "less-myopic" scheduling rules for dynamic job shop scheduling with genetic programming Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, (927-934)
  182. Pralet C, Verfaillie G, Maillard A, Hébrard E, Jozefowiez N, Huguet M, Desmousceaux T, Blanc-Paques P and Jaubert J Satellite data download management with uncertainty about the generated volumes Proceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling, (430-438)
  183. ACM
    Elhart I, Langheinrich M, Memarovic N and Heikkinen T Scheduling Interactive and Concurrently Running Applications in Pervasive Display Networks Proceedings of The International Symposium on Pervasive Displays, (104-109)
  184. Ströhle P, Gerding E, de Weerdt M, Stein S and Robu V Online mechanism design for scheduling non-preemptive jobs under uncertain supply and demand Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (437-444)
  185. Nguyen S, Zhang M and Johnston M Enhancing Branch-and-Bound Algorithms for Order Acceptance and Scheduling with Genetic Programming Revised Selected Papers of the 17th European Conference on Genetic Programming - Volume 8599, (124-136)
  186. Ananthanarayanan G, Hung M, Ren X, Stoica I, Wierman A and Yu M GRASS Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, (289-302)
  187. ACM
    Georgiadis G and Papatriantafilou M Dealing with storage without forecasts in smart grids Proceedings of the 29th Annual ACM Symposium on Applied Computing, (518-524)
  188. Yang S, Hsu C and Yang D (2014). Note on "Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time", Information Sciences: an International Journal, 260, (215-217), Online publication date: 1-Mar-2014.
  189. Boland N, Kalinowski T, Waterer H and Zheng L (2014). Scheduling arc maintenance jobs in a network to maximize total flow over time, Discrete Applied Mathematics, 163:P1, (34-52), Online publication date: 30-Jan-2014.
  190. (2014). Bridging control and artificial intelligence theories for diagnosis, Engineering Applications of Artificial Intelligence, 27:C, (1-16), Online publication date: 1-Jan-2014.
  191. Da Silva B, Morabito R, Yamashita D and Yanasse H (2014). Production scheduling of assembly fixtures in the aeronautical industry, Computers and Industrial Engineering, 67, (195-203), Online publication date: 1-Jan-2014.
  192. Bathrinath S, Sankar S, Ponnambalam S and Kannan B Bi-objective Optimization in Identical Parallel Machine Scheduling Problem 4th International Conference on Swarm, Evolutionary, and Memetic Computing - Volume 8297, (377-388)
  193. Angelidis E, Bohn D and Rose O A simulation tool for complex assembly lines with multi-skilled resources Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (2577-2586)
  194. Doleschal D, Weigert G, Klemmt A and Lehmann F Advanced secondary resource control in semiconductor lithography areas Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (3879-3890)
  195. Gißrau M and Rose O Practical assessment of a combined dispatching policy at a high-mix low-volume ASIC facility Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (3745-3755)
  196. Hsu C, Ji M, Guo J and Yang D (2013). Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities, Information Sciences: an International Journal, 253, (163-169), Online publication date: 1-Dec-2013.
  197. Hecker F, Hussein W, Paquet-Durand O, Hussein M and Becker T (2013). A case study on using evolutionary algorithms to optimize bakery production planning, Expert Systems with Applications: An International Journal, 40:17, (6837-6847), Online publication date: 1-Dec-2013.
  198. Pinedo M and Reed J (2013). The "least flexible job first" rule in scheduling and in queueing, Operations Research Letters, 41:6, (618-621), Online publication date: 1-Nov-2013.
  199. Jagtenberg C, Schwiegelshohn U and Uetz M (2013). Analysis of Smith's rule in stochastic machine scheduling, Operations Research Letters, 41:6, (570-575), Online publication date: 1-Nov-2013.
  200. Taboada I, Liberal F, Fajardo J and Ayesta U (2013). QoE-aware optimization of multimedia flow scheduling, Computer Communications, 36:15-16, (1629-1638), Online publication date: 1-Sep-2013.
  201. Malakooti B, Sheikh S, Al-Najjar C and Kim H (2013). Multi-objective energy aware multiprocessor scheduling using bat intelligence, Journal of Intelligent Manufacturing, 24:4, (805-819), Online publication date: 1-Aug-2013.
  202. González M, Vela C, González-Rodríguez I and Varela R (2013). Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times, Journal of Intelligent Manufacturing, 24:4, (741-754), Online publication date: 1-Aug-2013.
  203. ACM
    Ogur E and Aydin M Refining scheduling policies with genetic algorithms Proceedings of the 15th annual conference companion on Genetic and evolutionary computation, (1513-1518)
  204. ACM
    Amorim R, Dias B, de Freitas R and Uchoa E A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines Proceedings of the 15th annual conference companion on Genetic and evolutionary computation, (63-64)
  205. Gu M and Lu X (2013). The expected asymptotical ratio for preemptive stochastic online problem, Theoretical Computer Science, 495, (96-112), Online publication date: 1-Jul-2013.
  206. Dong J, Zhang A, Chen Y and Yang Q (2013). Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination, Theoretical Computer Science, 491:C, (94-102), Online publication date: 17-Jun-2013.
  207. Iyoob I, Zarifoglu E and Dieker A (2013). Cloud Computing Operations Research, Service Science, 5:2, (88-101), Online publication date: 1-Jun-2013.
  208. Wu C, Cheng S, Wu W, Yin Y and Wu W (2013). The single-machine total tardiness problem with unequal release times and a linear deterioration, Applied Mathematics and Computation, 219:20, (10401-10415), Online publication date: 1-Jun-2013.
  209. Cordier J and Riane F (2013). Towards a centralised appointments system to optimise the length of patient stay, Decision Support Systems, 55:2, (629-639), Online publication date: 1-May-2013.
  210. Ebadi A and Moslehi G (2013). An optimal method for the preemptive job shop scheduling problem, Computers and Operations Research, 40:5, (1314-1327), Online publication date: 1-May-2013.
  211. Chan C, Green L, Lu Y, Leahy N and Yurt R (2013). Prioritizing Burn-Injured Patients During a Disaster, Manufacturing & Service Operations Management, 15:2, (170-190), Online publication date: 1-Apr-2013.
  212. Chen Y, Zhang A, Chen G and Dong J (2013). Approximation algorithms for parallel open shop scheduling, Information Processing Letters, 113:7, (220-224), Online publication date: 1-Apr-2013.
  213. Elyasi A and Salmasi N (2013). Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming, Mathematical and Computer Modelling: An International Journal, 57:5, (1154-1164), Online publication date: 1-Mar-2013.
  214. Zhang R, Song S and Wu C (2013). A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion, Applied Soft Computing, 13:3, (1448-1458), Online publication date: 1-Mar-2013.
  215. Subramani K, Williamson M and Gu X (2013). Improved algorithms for optimal length resolution refutation in difference constraint systems, Formal Aspects of Computing, 25:2, (319-341), Online publication date: 1-Mar-2013.
  216. Yazdani Sabouni M and Logendran R (2013). A single machine carryover sequence-dependent group scheduling in PCB manufacturing, Computers and Operations Research, 40:1, (236-247), Online publication date: 1-Jan-2013.
  217. Pan Q and Ruiz R (2013). A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Computers and Operations Research, 40:1, (117-128), Online publication date: 1-Jan-2013.
  218. Angelidis E, Bohn D and Rose O A simulation-based optimization heuristic using self-organization for complex assembly lines Proceedings of the Winter Simulation Conference, (1-10)
  219. Werner S, Lehmann F, Klemmt A and Domaschke J One solver for all - a generic allocation concept for planning and shop floor control Proceedings of the Winter Simulation Conference, (1-10)
  220. Doleschal D, Lange J, Weigert G and Klemmt A Improving flow line scheduling by upstream mixed integer resource allocation in a wafer test facility Proceedings of the Winter Simulation Conference, (1-12)
  221. Gißrau M and Rose O Development and introduction of a combined dispatching policy at a high-mix low-volume ASIC facility Proceedings of the Winter Simulation Conference, (1-10)
  222. Lange J, Weigert G, Keil S, Lasch R and Eberts D Introducing the virtual time based flow principle in a high-mix low-volume wafer test facility and exploring the behavior of its key performance indicators Proceedings of the Winter Simulation Conference, (1-12)
  223. Cai X and Vairaktarakis G (2012). Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs, Operations Research, 60:6, (1436-1450), Online publication date: 1-Nov-2012.
  224. Nouri M and Ghodsi M (2012). Scheduling tasks with exponential duration on unrelated parallel machines, Discrete Applied Mathematics, 160:16-17, (2462-2473), Online publication date: 1-Nov-2012.
  225. Loewenstern D and Diao Y A dynamic request dispatching system for IT service management Proceedings of the 8th International Conference on Network and Service Management, (271-275)
  226. ACM
    Hong C, Caesar M and Godfrey P (2012). Finishing flows quickly with preemptive scheduling, ACM SIGCOMM Computer Communication Review, 42:4, (127-138), Online publication date: 24-Sep-2012.
  227. Wierman A and Zwart B (2012). Is Tail-Optimal Scheduling Possible?, Operations Research, 60:5, (1249-1257), Online publication date: 1-Sep-2012.
  228. ACM
    Hong C, Caesar M and Godfrey P Finishing flows quickly with preemptive scheduling Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication, (127-138)
  229. ACM
    Tang Q, Gupta S and Varsamopoulos G (2012). A Unified Methodology for Scheduling in Distributed Cyber-Physical Systems, ACM Transactions on Embedded Computing Systems, 11:S2, (1-25), Online publication date: 1-Aug-2012.
  230. Fanjul-Peyro L and Ruiz R (2012). Scheduling unrelated parallel machines with optional machines and jobs selection, Computers and Operations Research, 39:7, (1745-1753), Online publication date: 1-Jul-2012.
  231. Ranjbar M, Davari M and Leus R (2012). Two branch-and-bound algorithms for the robust parallel machine scheduling problem, Computers and Operations Research, 39:7, (1652-1660), Online publication date: 1-Jul-2012.
  232. Ebadi A and Moslehi G (2012). Mathematical models for preemptive shop scheduling problems, Computers and Operations Research, 39:7, (1605-1614), Online publication date: 1-Jul-2012.
  233. Mosheiov G and Oron D (2012). Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times, Computers and Operations Research, 39:7, (1601-1604), Online publication date: 1-Jul-2012.
  234. Cire A and Hoeve W MDD propagation for disjunctive scheduling Proceedings of the Twenty-Second International Conference on International Conference on Automated Planning and Scheduling, (11-19)
  235. Khazankin R, Schall D and Dustdar S Predicting qos in scheduled crowdsourcing Proceedings of the 24th international conference on Advanced Information Systems Engineering, (460-472)
  236. Alechina N, Dastani M and Logan B Programming norm-aware agents Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (1057-1064)
  237. Stein S, Gerding E, Robu V and Jennings N A model-based online mechanism with pre-commitment and its application to electric vehicle charging Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (669-676)
  238. Bampis E, Letsios D, Lucarelli G, Markakis E and Milis I On multiprocessor temperature-aware scheduling problems Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management, (149-160)
  239. Nishikawa K, Nishizeki T and Zhou X Algorithms for bandwidth consecutive multicolorings of graphs Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management, (117-128)
  240. ACM
    Colombo A and Del Vecchio D Efficient algorithms for collision avoidance at intersections Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control, (145-154)
  241. ACM
    Boehm M, Dannecker L, Doms A, Dovgan E, Filipič B, Fischer U, Lehner W, Pedersen T, Pitarch Y, Šikšnys L and Tušar T Data management in the MIRABEL smart grid system Proceedings of the 2012 Joint EDBT/ICDT Workshops, (95-102)
  242. Zhang R and Wu C (2012). A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates, Engineering Applications of Artificial Intelligence, 25:2, (209-221), Online publication date: 1-Mar-2012.
  243. ACM
    Wolf J, Balmin A, Rajan D, Hildrum K, Khandekar R, Parekh S, Wu K and Vernica R (2012). CIRCUMFLEX, ACM SIGOPS Operating Systems Review, 46:1, (26-32), Online publication date: 16-Feb-2012.
  244. Shabtay D and Karhi S (2012). Online scheduling of two job types on a set of multipurpose machines with unit processing times, Computers and Operations Research, 39:2, (405-412), Online publication date: 1-Feb-2012.
  245. Haned A, Soukhal A, Boudhar M and Huynh Tuong N (2012). Scheduling on parallel machines with preemption and transportation delays, Computers and Operations Research, 39:2, (374-381), Online publication date: 1-Feb-2012.
  246. Kaplan S and Rabadi G (2012). Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times, Computers and Industrial Engineering, 62:1, (276-285), Online publication date: 1-Feb-2012.
  247. Liao C, Chao C and Chen L (2012). An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times, Computers & Mathematics with Applications, 63:1, (110-117), Online publication date: 1-Jan-2012.
  248. Klemmt A and Weigert G An optimization approach for parallel machine problems with dedication constraints Proceedings of the Winter Simulation Conference, (1986-1998)
  249. Hekmatfar M, Fatemi Ghomi S and Karimi B (2011). Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan, Applied Soft Computing, 11:8, (4530-4539), Online publication date: 1-Dec-2011.
  250. Lai P and Wu H (2011). Evaluate the fuzzy completion times in the fuzzy flow shop scheduling problems using the virus-evolutionary genetic algorithms, Applied Soft Computing, 11:8, (4540-4550), Online publication date: 1-Dec-2011.
  251. Puente J, Vela C and González-Rodríguez I Combining neighbourhoods in fuzzy job shop problems Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence, (343-352)
  252. Xu X (2011). Minimizing weighted waiting time variance on a single processor, Computers and Industrial Engineering, 61:4, (1233-1239), Online publication date: 1-Nov-2011.
  253. Klus$#225;ček D and Rudov$#225; H Efficient data representation of large job schedules Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science, (103-113)
  254. Hsu C, Cheng T and Yang D (2011). Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time, Information Sciences: an International Journal, 181:20, (4799-4803), Online publication date: 1-Oct-2011.
  255. Chung C, Dawande M, Rajamani D and Sriskandarajah C (2011). A Short-Range Scheduling Model for Blockbuster's Order-Processing Operation, Interfaces, 41:5, (466-484), Online publication date: 1-Sep-2011.
  256. Cheng H, Chiang T and Fu L (2011). A two-stage hybrid memetic algorithm for multiobjective job shop scheduling, Expert Systems with Applications: An International Journal, 38:9, (10983-10998), Online publication date: 1-Sep-2011.
  257. Narang A and Shyamasundar R (2011). Performance driven distributed scheduling of parallel hybrid computations, Theoretical Computer Science, 412:32, (4212-4225), Online publication date: 1-Jul-2011.
  258. Yedidsion L, Shabtay D and Kaspi M (2011). Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Discrete Applied Mathematics, 159:12, (1264-1278), Online publication date: 1-Jul-2011.
  259. Bergmann S and Stelzer S Approximation of Dispatching Rules in Manufacturing Control Using Artificial Neural Networks Proceedings of the 2011 IEEE Workshop on Principles of Advanced and Distributed Simulation, (1-8)
  260. Rossi A, Sevaux M, Singh A and Geiger M On the cover scheduling problem in wireless sensor networks Proceedings of the 5th international conference on Network optimization, (657-668)
  261. Moffitt M and Günther G Scalable scheduling for hardware-accelerated functional verification Proceedings of the Twenty-First International Conference on International Conference on Automated Planning and Scheduling, (162-169)
  262. ACM
    Aalto S, Penttinen A, Lassila P and Osti P (2011). On the optimal trade-off between SRPT and opportunistic scheduling, ACM SIGMETRICS Performance Evaluation Review, 39:1, (145-155), Online publication date: 7-Jun-2011.
  263. ACM
    Aalto S, Penttinen A, Lassila P and Osti P On the optimal trade-off between SRPT and opportunistic scheduling Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, (185-196)
  264. Palacios J, González-Rodríguez I, Vela C and Puente J Particle swarm optimisation for open shop problems with fuzzy durations Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I, (362-371)
  265. Cheng T, Hsu C and Yang D (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities, Computers and Industrial Engineering, 60:4, (602-605), Online publication date: 1-May-2011.
  266. ACM
    Hatun K, Bockisch C, Sözer H and Akşit M A feature model and development approach for schedulers Proceedings of the 1st workshop on Modularity in systems software, (1-5)
  267. ACM
    Hsu C and Hefeeda M (2011). Statistical multiplexing of variable-bit-rate videos streamed to mobile devices, ACM Transactions on Multimedia Computing, Communications, and Applications, 7:2, (1-23), Online publication date: 1-Feb-2011.
  268. Wang J and Wang M (2011). A revision of machine scheduling problems with a general learning effect, Mathematical and Computer Modelling: An International Journal, 53:1-2, (330-336), Online publication date: 1-Jan-2011.
  269. Zinder Y, Memar J and Singh G Discrete optimization with polynomially detectable boundaries and restricted level sets Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I, (142-156)
  270. Gocgun Y and Ghate A A Lagrangian approach to dynamic resource allocation Proceedings of the Winter Simulation Conference, (3330-3340)
  271. Sobeyko O and Mönch L Genetic algorithms to solve a single machine multiple orders per job scheduling problem Proceedings of the Winter Simulation Conference, (2493-2503)
  272. Mosheiov G, Sarig A and Sidney J (2010). The Browne-Yechiali single-machine sequence is optimal for flow-shops, Computers and Operations Research, 37:11, (1965-1967), Online publication date: 1-Nov-2010.
  273. ACM
    Lu Y and Squillante M (2010). On approximations for multiple multidimensional stochastic knapsacks, ACM SIGMETRICS Performance Evaluation Review, 38:2, (45-47), Online publication date: 15-Oct-2010.
  274. Zhang Y, Zhou Z and Liu J (2010). The production scheduling problem in a multi-page invoice printing system, Computers and Operations Research, 37:10, (1814-1821), Online publication date: 1-Oct-2010.
  275. Barták R, Salido M and Rossi F (2010). Review:, The Knowledge Engineering Review, 25:3, (249-279), Online publication date: 1-Sep-2010.
  276. Li S and Yuan J (2010). Parallel-machine scheduling with deteriorating jobs and rejection, Theoretical Computer Science, 411:40-42, (3642-3650), Online publication date: 1-Sep-2010.
  277. de Farias I, Zhao H and Zhao M (2010). A family of inequalities valid for the robust single machine scheduling polyhedron, Computers and Operations Research, 37:9, (1610-1614), Online publication date: 1-Sep-2010.
  278. Puente J, Vela C and González-Rodríguez I Fast Local Search for Fuzzy Job Shop Scheduling Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (739-744)
  279. Arnaout J (2010). Heuristics for the Maximization of Operating Rooms Utilization Using Simulation, Simulation, 86:8-9, (573-583), Online publication date: 1-Aug-2010.
  280. McGarry M, Reisslein M, Aurzada F and Scheutzow M (2010). Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays, IEEE Journal on Selected Areas in Communications, 28:6, (849-862), Online publication date: 1-Aug-2010.
  281. ACM
    Hildebrandt T, Heger J and Scholz-Reiter B Towards improved dispatching rules for complex shop floor scenarios Proceedings of the 12th annual conference on Genetic and evolutionary computation, (257-264)
  282. Sadiq B and De Veciana G (2010). Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler, IEEE Transactions on Information Theory, 56:7, (3395-3412), Online publication date: 1-Jul-2010.
  283. Bożejko W, Uchroński M and Wodecki M Parallel meta2heuristics for the flexible job shop problem Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II, (395-402)
  284. ACM
    Xia L, Conitzer V and Procaccia A A scheduling approach to coalitional manipulation Proceedings of the 11th ACM conference on Electronic commerce, (275-284)
  285. Cheng T and Wang X (2010). Machine scheduling with job class setup and delivery considerations, Computers and Operations Research, 37:6, (1123-1128), Online publication date: 1-Jun-2010.
  286. Ramchurn S, Polukarov M, Farinelli A, Truong C and Jennings N Coalition formation with spatial and temporal constraints Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 3 - Volume 3, (1181-1188)
  287. Sandholm T and Lai K Dynamic proportional share scheduling in Hadoop Proceedings of the 15th international conference on Job scheduling strategies for parallel processing, (110-131)
  288. Recalde D, Rutten C, Schuurman P and Vredeveld T Local search performance guarantees for restricted related parallel machine scheduling Proceedings of the 9th Latin American conference on Theoretical Informatics, (108-119)
  289. Azadeh A, Moghaddam M, Geranmayeh P and Naghavi A Scheduling flow shops with multiple processors Proceedings of the 2010 Spring Simulation Multiconference, (1-6)
  290. Ferreira D, Morabito R and Rangel S (2010). Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Computers and Operations Research, 37:4, (684-691), Online publication date: 1-Apr-2010.
  291. Xingong Z and Guangle Y (2010). Single-machine group scheduling problems with deteriorated and learning effect, Applied Mathematics and Computation, 216:4, (1259-1266), Online publication date: 1-Apr-2010.
  292. Karger D, Stein C and Wein J Scheduling algorithms Algorithms and theory of computation handbook, (20-20)
  293. Preve N (2010). Balanced Job Scheduling Based on Ant Algorithm for Grid Network, International Journal of Grid and High Performance Computing, 2:1, (34-50), Online publication date: 1-Jan-2010.
  294. Powell W (2010). Feature Article---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming, INFORMS Journal on Computing, 22:1, (2-17), Online publication date: 1-Jan-2010.
  295. Soveiko N, Nakhla M and Achar R (2010). Comparison study of performance of parallel steady state solver on different computer architectures, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 29:1, (65-77), Online publication date: 1-Jan-2010.
  296. Salmasi N, Logendran R and Skandari M (2010). Total flow time minimization in a flowshop sequence-dependent group scheduling problem, Computers and Operations Research, 37:1, (199-212), Online publication date: 1-Jan-2010.
  297. Naderi B, Fatemi Ghomi S, Aminnayeri M and Zandieh M (2010). A contribution and new heuristics for open shop scheduling, Computers and Operations Research, 37:1, (213-221), Online publication date: 1-Jan-2010.
  298. Ahmadizar F, Ghazanfari M and Fatemi Ghomi S (2010). Group shops scheduling with makespan criterion subject to random release dates and processing times, Computers and Operations Research, 37:1, (152-162), Online publication date: 1-Jan-2010.
  299. Sprenger R and Mönch L An ant colony optimization approach to solve cooperative transportation planning problems Winter Simulation Conference, (2488-2495)
  300. Khandekar R, Hildrum K, Parekh S, Rajan D, Wolf J, Wu K, Andrade H and Gedik B COLA Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware, (1-20)
  301. Puente J, Vela C, Hernández-Arauzo A and González-Rodríguez I Improving local search for the fuzzy job shop using a lower bound Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence, (222-232)
  302. Engineer F, Keskinocak P and Pickering L (2009). OR Practice---Catch-Up Scheduling for Childhood Vaccination, Operations Research, 57:6, (1307-1319), Online publication date: 1-Nov-2009.
  303. Chen C and Chen C (2009). A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, Computers and Operations Research, 36:11, (3073-3081), Online publication date: 1-Nov-2009.
  304. ACM
    Hsu C and Hefeeda M On statistical multiplexing of variable-bit-rate video streams in mobile systems Proceedings of the 17th ACM international conference on Multimedia, (411-420)
  305. Cai X, Wu X and Zhou X (2009). Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information, Operations Research, 57:5, (1236-1249), Online publication date: 1-Sep-2009.
  306. Ji M and Cheng T (2009). Parallel-machine scheduling of simple linear deteriorating jobs, Theoretical Computer Science, 410:38-40, (3761-3768), Online publication date: 1-Sep-2009.
  307. Matta M (2009). A genetic algorithm for the proportionate multiprocessor open shop, Computers and Operations Research, 36:9, (2601-2618), Online publication date: 1-Sep-2009.
  308. Kung L and Chern C (2009). Heuristic factory planning algorithm for advanced planning and scheduling, Computers and Operations Research, 36:9, (2513-2530), Online publication date: 1-Sep-2009.
  309. Dong X, Huang H and Chen P Study on heuristics for the permutation flowshop with sequence dependent setup times Proceedings of the 10th IEEE international conference on Information Reuse & Integration, (417-421)
  310. Cheng T, Lai P, Wu C and Lee W (2009). Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations, Information Sciences: an International Journal, 179:18, (3127-3135), Online publication date: 1-Aug-2009.
  311. Subramani K (2009). Optimal Length Resolution Refutations of Difference Constraint Systems, Journal of Automated Reasoning, 43:2, (121-137), Online publication date: 1-Aug-2009.
  312. Kim J, Ko M, Kang H and Kim J A Hybrid IP Forwarding Engine with High Performance and Low Power Proceedings of the International Conference on Computational Science and Its Applications: Part II, (888-899)
  313. ACM
    Ouelhadj D, Petrovic S and Ozcan E A multi-level search framework for asynchronous cooperation of multiple hyper-heuristics Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, (2193-2196)
  314. Hu B and Benjaafar S (2009). Partitioning of Servers in Queueing Systems During Rush Hour, Manufacturing & Service Operations Management, 11:3, (416-428), Online publication date: 1-Jul-2009.
  315. Ferris M, Maravelias C and Sundaramoorthy A (2009). Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid, INFORMS Journal on Computing, 21:3, (398-410), Online publication date: 1-Jul-2009.
  316. Pastor R, Altimiras J and Mateo M (2009). Planning production using mathematical programming, Computers and Operations Research, 36:7, (2173-2178), Online publication date: 1-Jul-2009.
  317. Wang J (2009). Single machine scheduling with decreasing linear deterioration under precedence constraints, Computers & Mathematics with Applications, 58:1, (95-103), Online publication date: 1-Jul-2009.
  318. Hu Y and Gui W Degenerating algorithm Proceedings of the 21st annual international conference on Chinese control and decision conference, (4302-4305)
  319. Yin Y, Xu D, Sun K and Li H (2009). Some scheduling problems with general position-dependent and time-dependent learning effects, Information Sciences: an International Journal, 179:14, (2416-2425), Online publication date: 15-Jun-2009.
  320. ACM
    Xu Z, Gu X, Jiao B and Gu J Research on job shop scheduling under uncertainty Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, (695-702)
  321. Su C, Pan J and Hsu T (2009). A new heuristic algorithm for the machine scheduling problem with job delivery coordination, Theoretical Computer Science, 410:27-29, (2581-2591), Online publication date: 1-Jun-2009.
  322. Fu B, Huo Y and Zhao H (2009). Exponential inapproximability and FPTAS for scheduling with availability constraints, Theoretical Computer Science, 410:27-29, (2663-2674), Online publication date: 1-Jun-2009.
  323. Stage A and Setzer T Network-aware migration control and scheduling of differentiated virtual machine workloads Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing, (9-14)
  324. Ochoa G, Vázquez-Rodríguez J, Petrovic S and Burke E Dispatching rules for production scheduling Proceedings of the Eleventh conference on Congress on Evolutionary Computation, (1873-1880)
  325. (2009). Book Reviews, Interfaces, 39:3, (291-297), Online publication date: 1-May-2009.
  326. Dawande M, Pinedo M and Sriskandarajah C (2009). Multiple Part-Type Production in Robotic Cells, Manufacturing & Service Operations Management, 11:2, (210-228), Online publication date: 1-Apr-2009.
  327. Harmanani H, Drouby F and Ghosn S A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves Proceedings of the 2009 Spring Simulation Multiconference, (1-8)
  328. Matsveichuk N, Sotskov Y, Egorova N and Lai T (2009). Schedule execution for two-machine flow-shop with interval processing times, Mathematical and Computer Modelling: An International Journal, 49:5-6, (991-1011), Online publication date: 1-Mar-2009.
  329. Hall N, Posner M and Potts C (2009). Online Scheduling with Known Arrival Times, Mathematics of Operations Research, 34:1, (92-102), Online publication date: 1-Feb-2009.
  330. Agnetis A, Detti P, Pranzo M and Sodhi M (2009). Sequencing unreliable jobs on parallel machines, Journal of Scheduling, 12:1, (45-54), Online publication date: 1-Feb-2009.
  331. Begen M and Queyranne M Appointment scheduling with discrete random durations Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (845-854)
  332. Agnetis A, Alfieri A and Nicosia G (2009). Single-Machine Scheduling Problems with Generalized Preemption, INFORMS Journal on Computing, 21:1, (1-12), Online publication date: 1-Jan-2009.
  333. Qian B, Wang L, Huang D, Wang W and Wang X (2009). An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, Computers and Operations Research, 36:1, (209-233), Online publication date: 1-Jan-2009.
  334. Robbins T and Harrison T A simulation based scheduling model for call centers with uncertain arrival rates Proceedings of the 40th Conference on Winter Simulation, (2884-2890)
  335. Sprenger R and Mönch L A simulation framework for assessing the performance of cooperative transportation planning algorithms Proceedings of the 40th Conference on Winter Simulation, (2769-2776)
  336. Sheopuri A, Zeng S and Dorai C A new policy for the service request assignment problem with multiple severity level, due date and SLA penalty service requests Proceedings of the 40th Conference on Winter Simulation, (1661-1668)
  337. Arnaout J and Kulbashian S Maximizing the utilization of operating rooms with stochastic times using simulation Proceedings of the 40th Conference on Winter Simulation, (1617-1623)
  338. ACM
    Chan W and Schruben L (2009). Mathematical programming models of closed tandem queueing networks, ACM Transactions on Modeling and Computer Simulation, 19:1, (1-27), Online publication date: 1-Dec-2008.
  339. Wang J, Ng C and Cheng T (2008). Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Computers and Operations Research, 35:8, (2684-2693), Online publication date: 1-Aug-2008.
  340. Ballestín F and Leus R (2008). Meta-heuristics for stable scheduling on a single machine, Computers and Operations Research, 35:7, (2175-2192), Online publication date: 1-Jul-2008.
  341. Csáji B and Monostori L (2008). Value Function Based Reinforcement Learning in Changing Markovian Environments, The Journal of Machine Learning Research, 9, (1679-1709), Online publication date: 1-Jun-2008.
  342. ACM
    Crutchfield C, Dzunic Z, Fineman J, Karger D and Scott J Improved approximations for multiprocessor scheduling under uncertainty Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, (246-255)
  343. Csáji B and Monostori L (2008). Adaptive stochastic resource control, Journal of Artificial Intelligence Research, 32:1, (453-486), Online publication date: 1-May-2008.
  344. Cai X, Chen J, Xiao Y and Xu X (2008). Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline, Computers and Operations Research, 35:5, (1671-1683), Online publication date: 1-May-2008.
  345. Burke E, Dror M and Orlin J (2008). Scheduling malleable tasks with interdependent processing rates, Discrete Applied Mathematics, 156:5, (620-626), Online publication date: 1-Mar-2008.
  346. Subramani K and Madduri K Accomplishing approximate FCFS fairness without queues Proceedings of the 14th international conference on High performance computing, (540-551)
  347. Driessel R and Mönch L Simulation framework for complex manufacturing systems with automated material handling Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come, (1713-1721)
  348. Ko S, Morales R and Gupta I New worker-centric scheduling strategies for data-intensive grid applications Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware, (121-142)
  349. Ruiz R, Carlos García-Díaz J and Maroto C (2007). Considering scheduling and preventive maintenance in the flowshop sequencing problem, Computers and Operations Research, 34:11, (3314-3330), Online publication date: 1-Nov-2007.
  350. Malve S and Uzsoy R (2007). A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Computers and Operations Research, 34:10, (3016-3028), Online publication date: 1-Oct-2007.
  351. Schepperle H and Böhm K Agent-Based Traffic Control Using Auctions Proceedings of the 11th international workshop on Cooperative Information Agents XI, (119-133)
  352. Gatto M and Widmayer P On the robustness of graham's algorithm for online scheduling Proceedings of the 10th international conference on Algorithms and Data Structures, (349-361)
  353. Witt A and Voß S (2007). Simple heuristics for scheduling with limited intermediate storage, Computers and Operations Research, 34:8, (2293-2309), Online publication date: 1-Aug-2007.
  354. ACM
    Salhi A, Rodríguez J and Zhang Q An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem Proceedings of the 9th annual conference on Genetic and evolutionary computation, (570-576)
  355. Caldeira J, Azevedo R, Silva C and Sousa J Beam-ACO Distributed Optimization Applied to Supply-Chain Management Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing, (799-809)
  356. Frachtenberg E and Schwiegelshohn U New challenges of parallel job scheduling Proceedings of the 13th international conference on Job scheduling strategies for parallel processing, (1-23)
  357. Asahiro Y, Jansson J, Miyano E, Ono H and Zenmyo K Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management, (167-177)
  358. Sarin S, Shenai V and Wang L Releasing and Scheduling of Lots in a Wafer Fab Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management, (108-119)
  359. Guo Y, Lim A, Rodrigues B and Yu S (2007). Machine scheduling performance with maintenance and failure, Mathematical and Computer Modelling: An International Journal, 45:9-10, (1067-1080), Online publication date: 1-May-2007.
  360. Shen Z (2007). Integrated Stochastic Supply-Chain Design Models, Computing in Science and Engineering, 9:2, (50-59), Online publication date: 1-Mar-2007.
  361. Dumitraş T, Rosu D, Dan A and Narasimhan P Ecotopia Architecting dependable systems IV, (262-286)
  362. Beck J and Wilson N (2007). Proactive algorithms for job shop scheduling with probabilistic durations, Journal of Artificial Intelligence Research, 28:1, (183-232), Online publication date: 1-Jan-2007.
  363. Boile M, Theofanis S and Golias M Berth allocation with service priorities Proceedings of the 5th WSEAS international conference on System science and simulation in engineering, (72-77)
  364. Zimmermann J and Mönch L Simulation-based selection of machine criticality measures for a shifting bottleneck heuristic Proceedings of the 38th conference on Winter simulation, (1848-1854)
  365. Dong X, Huang H and Chen P A more effective constructive algorithm for permutation flowshop problem Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning, (25-32)
  366. Gabel T and Riedmiller M Multi-agent case-based reasoning for cooperative reinforcement learners Proceedings of the 8th European conference on Advances in Case-Based Reasoning, (32-46)
  367. Csáji B and Monostori L Adaptive sampling based large-scale stochastic resource control Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (815-820)
  368. Koźlak J, Créput J, Hilaire V and Koukam A (2006). Multi-agent approach to dynamic pick-up and delivery problem with uncertain knowledge about future transport demands, Fundamenta Informaticae, 71:1, (27-36), Online publication date: 1-Jul-2006.
  369. Gonçalves C, Trabasso L and Loureiro G Integrated CE tools for postponed aerospace product and process decisions Proceedings of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering, (477-487)
  370. Subramani K and Argentieri J Analyzing chain programs over difference constraints Proceedings of the Third international conference on Theory and Applications of Models of Computation, (171-180)
  371. Chen Z and Pundoor G (2006). Order Assignment and Scheduling in a Supply Chain, Operations Research, 54:3, (555-572), Online publication date: 1-May-2006.
  372. Chen Y, Li Z, Jin Q and Wang C Study on qos driven web services composition Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development, (702-707)
  373. Subramani K Totally clairvoyant scheduling with relative timing constraints Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation, (398-411)
  374. Ha B, Bae J, Park Y and Kang S (2006). Development of process execution rules for workload balancing on agents, Data & Knowledge Engineering, 56:1, (64-84), Online publication date: 1-Jan-2006.
  375. Arnaout J and Rabadi G Minimizing the total weighted completion time on unrelated parallel machines with stochastic times Proceedings of the 37th conference on Winter simulation, (2141-2147)
  376. Li X and Olafsson S (2005). Discovering Dispatching Rules Using Data Mining, Journal of Scheduling, 8:6, (515-527), Online publication date: 1-Dec-2005.
  377. Duenas A, Petrovic D and Petrovic S Analysis of performance of fuzzy logic-based production scheduling by simulation Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence, (234-243)
  378. Wei B, Fedak G and Cappello F Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing, (219-226)
  379. Boyer W and Hura G (2005). Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments, Journal of Parallel and Distributed Computing, 65:9, (1035-1046), Online publication date: 1-Sep-2005.
  380. T'kindt V, Billaut J, Bouquard J, Lenté C, Martineau P, Néron E, Proust C and Tacquard C (2005). The e-OCEA project, Decision Support Systems, 40:2, (329-337), Online publication date: 1-Aug-2005.
  381. Fayad C and Petrovic S A fuzzy genetic algorithm for real-world job shop scheduling Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence, (524-533)
  382. Blum C (2005). Beam-ACO, Computers and Operations Research, 32:6, (1565-1591), Online publication date: 1-Jun-2005.
  383. Garg N, Grosu D and Chaudhary V An Antisocial Strategy for Scheduling Mechanisms Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
  384. Behrmann G, Brinksma E, Hendriks M and Mader A Production Scheduling by Reachability Analysis - A Case Study Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
  385. Subramani K (2005). An Analysis of Totally Clairvoyant Scheduling, Journal of Scheduling, 8:2, (113-133), Online publication date: 1-Apr-2005.
  386. Weng C, Li M and Lu X Resource management and scheduling for high performance computing application based on WSRF Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development, (718-729)
  387. Weng C and Lu X (2005). Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid, Future Generation Computer Systems, 21:2, (271-280), Online publication date: 1-Feb-2005.
  388. Rojanasoonthon S and Bard J (2005). A GRASP for Parallel Machine Scheduling with Time Windows, INFORMS Journal on Computing, 17:1, (32-51), Online publication date: 1-Jan-2005.
  389. Fowler J, Kim B, Carlyle W, Gel E and Horng S (2005). Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems, Journal of Scheduling, 8:1, (75-96), Online publication date: 1-Jan-2005.
  390. Ray S and Zhang Z Heuristic-based scheduling to maximize throughput of data-intensive grid applications Proceedings of the 6th international conference on Distributed Computing, (63-74)
  391. Subramani K Zero-Clairvoyant scheduling with inter-period constraints Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, (236-247)
  392. Spivey M and Powell W (2004). The Dynamic Assignment Problem, Transportation Science, 38:4, (399-419), Online publication date: 1-Nov-2004.
  393. Kornienko S, Kornienko O and Priese J (2004). Application of multi-agent planning to the assignment problem, Computers in Industry, 54:3, (273-290), Online publication date: 1-Aug-2004.
  394. Liaw C (2004). Scheduling two-machine preemptive open shops to minimize total completion time, Computers and Operations Research, 31:8, (1349-1363), Online publication date: 1-Jul-2004.
  395. ACM
    Gupta A, Pál M, Ravi R and Sinha A Boosted sampling Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, (417-426)
  396. Iyer S and Saxena B (2004). Improved genetic algorithm for the permutation flowshop scheduling problem, Computers and Operations Research, 31:4, (593-606), Online publication date: 1-Apr-2004.
  397. ACM
    Ungureanu V, Melamed B, Bradford P and Katehakis M Class-Dependent Assignment in cluster-based servers Proceedings of the 2004 ACM symposium on Applied computing, (1420-1425)
  398. Chong C, Sivakumar A and Gay R Factory scheduling Proceedings of the 35th conference on Winter simulation: driving innovation, (1433-1439)
  399. Vairaktarakis G (2003). Simple Algorithms for Gilmore–Gomory's Traveling Salesman and Related Problems, Journal of Scheduling, 6:6, (499-520), Online publication date: 1-Nov-2003.
  400. Aerts J, Korst J, Spieksma F, Verhaegh W and Woeginger G (2003). Random Redundant Storage in Disk Arrays, IEEE Transactions on Computers, 52:9, (1210-1214), Online publication date: 1-Sep-2003.
  401. Arkin E, Bender M, Mitchell J and Skiena S (2003). The Lazy Bureaucrat scheduling problem, Information and Computation, 184:1, (129-146), Online publication date: 10-Jul-2003.
  402. Hall N, Laporte G, Selvarajah E and Sriskandarajah C (2003). Scheduling and lot streaming in flowshops with no-wait in process, Journal of Scheduling, 6:4, (339-354), Online publication date: 1-Jul-2003.
  403. Cochran J, Horng S and Fowler J (2003). A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines, Computers and Operations Research, 30:7, (1087-1102), Online publication date: 1-Jun-2003.
  404. Błażewicz J, Formanowicz P and Urbaniak R DNA based algorithms for some scheduling problems Proceedings of the 2003 international conference on Applications of evolutionary computing, (673-683)
  405. Gupta A and Sivakumar A Semiconductor manufacturing Proceedings of the 34th conference on Winter simulation: exploring new frontiers, (1862-1870)
  406. Brucker P (2002). Scheduling and constraint propagation, Discrete Applied Mathematics, 123:1-3, (227-256), Online publication date: 15-Nov-2002.
  407. Agrawal V, Lopomo G and Seshadri S (2002). Web Based Capacity Allocation Strategies for Customers with Heterogeneous Preferences, Electronic Commerce Research, 2:4, (359-384), Online publication date: 1-Nov-2002.
  408. Qi X, Yu G and Bard J (2002). Single machine scheduling with assignable due dates, Discrete Applied Mathematics, 122:1-3, (211-233), Online publication date: 15-Oct-2002.
  409. Schmitz M, Al-Hashimi B and Eles P (2002). Synthesizing Energy-Efficient Embedded Systems with LOPOCOS, Design Automation for Embedded Systems, 6:4, (401-424), Online publication date: 1-Jul-2002.
  410. Lewis H and Slotnick S (2002). Multi-period job selection, Computers and Operations Research, 29:8, (1081-1098), Online publication date: 1-Jul-2002.
  411. ACM
    Wolf J, Squillante M, Yu P, Sethuraman J and Ozsen L Optimal crawling strategies for web search engines Proceedings of the 11th international conference on World Wide Web, (136-147)
  412. (2002). Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems, INFORMS Journal on Computing, 14:2, (98-123), Online publication date: 1-May-2002.
  413. Hall N and Posner M (2001). Generating Experimental Data for Computational Testing with Machine Scheduling Applications, Operations Research, 49:6, (854-865), Online publication date: 1-Dec-2001.
  414. Wolf J, Squillante M, Turek J, Yu P and Sethuraman J (2001). Scheduling Algorithms for the Broadcast Delivery of Digital Products, IEEE Transactions on Knowledge and Data Engineering, 13:5, (721-741), Online publication date: 1-Sep-2001.
  415. Elkins D and Wortman M (2001). On Numerical Solution of the Markov Renewal Equation: Tight Upper and Lower Kernel Bounds, Methodology and Computing in Applied Probability, 3:3, (239-253), Online publication date: 1-Sep-2001.
  416. Schruben L Mathematical programming models of discrete event system dynamics Proceedings of the 32nd conference on Winter simulation, (381-385)
  417. Casanova H, Obertelli G, Berman F and Wolski R (2000). The AppLeS Parameter Sweep Template: User-level middleware for the Grid\m{1}, Scientific Programming, 8:3, (111-126), Online publication date: 1-Aug-2000.
  418. Miller D, Chen H, Matson J and Liu Q (1999). A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem, Journal of Heuristics, 5:4, (437-454), Online publication date: 1-Dec-1999.
  419. Goel A and Indyk P Stochastic Load Balancing and Related Problems Proceedings of the 40th Annual Symposium on Foundations of Computer Science
  420. Swami S, Eliashberg J and Weinberg C (1999). SilverScreener, Marketing Science, 18:3, (352-372), Online publication date: 1-Aug-1999.
  421. Braun T, Siegel H, Beck N, Bölóni L, Reuther A, Theys M, Yao B, Freund R, Maheswaran M, Robertson J and Hensgen D A Comparison Study of Static Mapping Heuristics for a Class of Meta-Tasks on Heterogeneous Computing Systems Proceedings of the Eighth Heterogeneous Computing Workshop
  422. Maheswaran M, Ali S, Siegel H, Hensgen D and Freund R Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems Proceedings of the Eighth Heterogeneous Computing Workshop
  423. Ríos-Mercado R and Bard J (1999). An Enhanced TSP-Based Heuristic for Makespan Minimizationin a Flow Shop with Setup Times, Journal of Heuristics, 5:1, (53-70), Online publication date: 1-Apr-1999.
  424. ACM
    Knobe K, Rehg J, Chauhan A, Nikhil R and Ramachandran U Scheduling constrained dynamic applications on clusters Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (46-es)
  425. Ruiz-Torres A and Tyworth J Simulation based approach to study the interaction of scheduling and routing on a logistic network Proceedings of the 29th conference on Winter simulation, (1189-1194)
  426. ACM
    Kleinberg J, Rabani Y and Tardos É Allocating bandwidth for bursty connections Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (664-673)
  427. Manansang H and Heim J An online, simulation-based patient scheduling system Proceedings of the 28th conference on Winter simulation, (1170-1175)
  428. (1996). Constraint Propagation Based Scheduling of Job Shops, INFORMS Journal on Computing, 8:2, (144-157), Online publication date: 1-May-1996.
  429. Chatterjee A, Borokhovich M, Varshney L and Vishwanath S Efficient and flexible crowdsourcing of specialized tasks with precedence constraints IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
  430. Im S, Naghshnejad M and Singhal M Scheduling jobs with non-uniform demands on multiple servers without interruption IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
  431. Sundström N, Wigström O, Riazi S and Lennartson B On the conflict between energy, stability and robustness in production schedules 2016 IEEE International Conference on Automation Science and Engineering (CASE), (1263-1269)
  432. Jia Z, Zhang L, Chen G, Arinez J and Xiao G Performance evaluation in finite production run-based serial lines with geometric machines 2016 IEEE International Conference on Automation Science and Engineering (CASE), (450-455)
  433. Mei Y and Zhang M A comprehensive analysis on reusability of GP-evolved job shop dispatching rules 2016 IEEE Congress on Evolutionary Computation (CEC), (3590-3597)
  434. Masood A, Mei Y, Chen G and Zhang M Many-objective genetic programming for job-shop scheduling 2016 IEEE Congress on Evolutionary Computation (CEC), (209-216)
  435. Manirabona A, Boudjit S and Fourati L A Priority-Weighted Round Robin scheduling strategy for a WBAN based healthcare monitoring system 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC), (224-229)
  436. Tsarev A Multi-agent Supply Planning Methods Allowing the Real-Time Performance of the Supply Network Management Systems Industrial Applications of Holonic and Multi-Agent Systems, (81-95)
Contributors
  • Leonard N. Stern School of Business

Recommendations