IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v28y1980i6p1436-1441.html
   My bibliography  Save this item

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

Citations

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


Cited by:

  1. Zhi-Long Chen & George L. Vairaktarakis, 2005. "Integrated Scheduling of Production and Distribution Operations," Management Science, INFORMS, vol. 51(4), pages 614-628, April.
  2. Qijia Liu & Jinjiang Yuan, 2016. "Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 385-395, August.
  3. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
  4. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
  5. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
  6. Schmidt, Gunter, 2000. "Performance guarantee of two simple priority rules for production scheduling," International Journal of Production Economics, Elsevier, vol. 68(2), pages 151-159, November.
  7. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
  8. Liang-Liang Fu & Mohamed Ali Aloulou & Christian Artigues, 2018. "Integrated production and outbound distribution scheduling problems with job release dates and deadlines," Journal of Scheduling, Springer, vol. 21(4), pages 443-460, August.
  9. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 0. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
  10. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
  11. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
  12. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
  13. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
  14. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
  15. Lixin Tang & Feng Li & Jiyin Liu, 2015. "Integrated scheduling of loading and transportation with tractors and semitrailers separated," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 416-433, August.
  16. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
  17. Ronald Armstrong & Su Gao & Lei Lei, 2008. "A zero-inventory production and distribution problem with a fixed customer sequence," Annals of Operations Research, Springer, vol. 159(1), pages 395-414, March.
  18. Li, Chung-Lun & Vairaktarakis, George & Lee, Chung-Yee, 2005. "Machine scheduling with deliveries to multiple customer locations," European Journal of Operational Research, Elsevier, vol. 164(1), pages 39-51, July.
  19. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 2022. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1 , c = 1 | C max," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2195-2206, November.
  20. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
  21. Federico Alonso-Pecina & José Alberto Hernández & José Maria Sigarreta & Nodari Vakhania, 2020. "Fast Approximation for Scheduling One Machine," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
  22. Kathryn E. Stecke & Xuying Zhao, 2007. "Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode," Manufacturing & Service Operations Management, INFORMS, vol. 9(2), pages 206-224, September.
  23. Hanif D. Sherali & Youngho Lee & Donald D. Boyer, 1995. "Scheduling target illuminators in naval battle‐group anti‐air warfare," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 737-755, August.
  24. Shuo Zhang & Jianyou Xu & Yingli Qiao, 2023. "Multi-Objective Q-Learning-Based Brain Storm Optimization for Integrated Distributed Flow Shop and Distribution Scheduling Problems," Mathematics, MDPI, vol. 11(20), pages 1-25, October.
  25. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
  26. Sun Lee, Ik & Yoon, S.H., 2010. "Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs," Omega, Elsevier, vol. 38(6), pages 509-521, December.
  27. Péter Györgyi & Tamás Kis & Tímea Tamási & József Békési, 2023. "Joint replenishment meets scheduling," Journal of Scheduling, Springer, vol. 26(1), pages 77-94, February.
  28. Ji Tian & Yan Zhou & Ruyan Fu, 2020. "An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 170-180, July.
  29. Hfaiedh, Walid & Sadfi, Chérif & Kacem, Imed & Hadj-Alouane, Atidel, 2015. "A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 496-502.
  30. Philip Kaminsky, 2003. "The effectiveness of the longest delivery time rule for the flow shop delivery time problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 257-272, April.
  31. Guruprasad Pundoor & Zhi‐Long Chen, 2005. "Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 571-589, September.
  32. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
  33. Alejandro Reynoso & Nodari Vakhania, 2021. "Theoretical and practical issues in single-machine scheduling with two job release and delivery times," Journal of Scheduling, Springer, vol. 24(6), pages 615-647, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.