IDEAS home Printed from https://ideas.repec.org/r/spr/annopr/v70y1997i0p1-4110.1023-a1018909801944.html
   My bibliography  Save this item

Current trends in deterministic scheduling

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Peng Wu & Junheng Cheng & Feng Chu, 2021. "Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics," Annals of Operations Research, Springer, vol. 296(1), pages 471-494, January.
  2. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
  3. Liu, Peihai & Lu, Xiwen, 2016. "Integrated production and job delivery scheduling with an availability constraint," International Journal of Production Economics, Elsevier, vol. 176(C), pages 1-6.
  4. Stanisław Gawiejnowicz & Alexander Kononov, 2014. "Isomorphic scheduling problems," Annals of Operations Research, Springer, vol. 213(1), pages 131-145, February.
  5. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
  6. Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
  7. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
  8. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
  9. Mellouli, Racem & Sadfi, Chrif & Chu, Chengbin & Kacem, Imed, 2009. "Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1150-1165, September.
  10. J S Chen, 2006. "Single-machine scheduling with flexible and periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 703-710, June.
  11. Navid Hashemian & Claver Diallo & Béla Vizvári, 2014. "Makespan minimization for parallel machines scheduling with multiple availability constraints," Annals of Operations Research, Springer, vol. 213(1), pages 173-186, February.
  12. Emir Hüseyin Özder & Evrencan Özcan & Tamer Eren, 2019. "Staff Task-Based Shift Scheduling Solution with an ANP and Goal Programming Method in a Natural Gas Combined Cycle Power Plant," Mathematics, MDPI, vol. 7(2), pages 1-26, February.
  13. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
  14. Lai, Tsung-Chyan & Sotskov, Yuri N. & Sotskova, Nadezhda & Werner, Frank, 2004. "Mean flow time minimization with given bounds of processing times," European Journal of Operational Research, Elsevier, vol. 159(3), pages 558-573, December.
  15. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
  16. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.
  17. George L. Vairaktarakis & Chung‐Yee Lee, 2004. "Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 44-59, February.
  18. Jianer Chen & Chung‐Yee Lee, 1999. "General multiprocessor task scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 57-74, February.
  19. Huo, Yumei & Zhao, Hairong, 2018. "Two machine scheduling subject to arbitrary machine availability constraint," Omega, Elsevier, vol. 76(C), pages 128-136.
  20. Yin, Yunqiang & Wang, Yan & Cheng, T.C.E. & Liu, Wenqi & Li, Jinhai, 2017. "Parallel-machine scheduling of deteriorating jobs with potential machine disruptions," Omega, Elsevier, vol. 69(C), pages 17-28.
  21. Xiuli Wang & T. C. Edwin Cheng, 2007. "Machine scheduling with an availability constraint and job delivery coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 11-20, February.
  22. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
  23. Kumar, Subodha & Dutta, Kaushik & Mookerjee, Vijay, 2009. "Maximizing business value by optimal assignment of jobs to resources in grid computing," European Journal of Operational Research, Elsevier, vol. 194(3), pages 856-872, May.
  24. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
  25. C.T. Ng & Mikhail Y. Kovalyov, 2004. "An FPTAS for scheduling a two‐machine flowshop with one unavailability interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 307-315, April.
  26. Oguz, C. & Fikret Ercan, M. & Edwin Cheng, T. C. & Fung, Y. F., 2003. "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop," European Journal of Operational Research, Elsevier, vol. 149(2), pages 390-403, September.
  27. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
  28. Jingui Huang & Jianer Chen & Songqiao Chen & Jianxin Wang, 2007. "A simple linear time approximation algorithm for multi-processor job scheduling on four processors," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 33-45, January.
  29. Huang, Wei & Chen, Bo, 2007. "Scheduling of batch plants: Constraint-based approach and performance investigation," International Journal of Production Economics, Elsevier, vol. 105(2), pages 425-444, February.
  30. Cha, Young-Ho & Kim, Yeong-Dae, 2010. "Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities," Omega, Elsevier, vol. 38(5), pages 383-392, October.
  31. Richard L. Daniels & Joseph B. Mazzola & Dailun Shi, 2004. "Flow Shop Scheduling with Partial Resource Flexibility," Management Science, INFORMS, vol. 50(5), pages 658-669, May.
  32. Oguz, Ceyda & Zinder, Yakov & Ha Do, Van & Janiak, Adam & Lichtenstein, Maciej, 2004. "Hybrid flow-shop scheduling problems with multiprocessor task systems," European Journal of Operational Research, Elsevier, vol. 152(1), pages 115-131, January.
  33. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
  34. Pei-Chann Chang & Shih-Hsin Chen & Chin-Yuan Fan & V. Mani, 2010. "Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems," Annals of Operations Research, Springer, vol. 180(1), pages 197-211, November.
  35. Lee, C. -Y. & Leon, V. J., 2001. "Machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 128(1), pages 119-128, January.
  36. Janny M. Y. Leung & Guoqing Zhang & Xiaoguang Yang & Raymond Mak & Kokin Lam, 2004. "Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach," Operations Research, INFORMS, vol. 52(6), pages 965-976, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.