IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v11y1982i1p48-54.html
   My bibliography  Save this item

A bicriterion approach to time/cost trade-offs in sequencing

Citations

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


Cited by:

  1. Moshe Zofi & Ron Teller & Moshe Kaspi, 2017. "Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1177-1182, October.
  2. C. Ng & T. Cheng & Adam Janiak & Mikhail Kovalyov, 2005. "Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time," Annals of Operations Research, Springer, vol. 133(1), pages 163-174, January.
  3. Janiak, Adam, 1998. "Minimization of the makespan in a two-machine problem under given resource constraints," European Journal of Operational Research, Elsevier, vol. 107(2), pages 325-337, June.
  4. R-H Huang & C-L Yang, 2009. "An algorithm for minimizing flow time and maximum earliness on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 873-877, June.
  5. Yaron Leyvand & Dvir Shabtay & George Steiner & Liron Yedidsion, 2010. "Just-in-time scheduling with controllable processing times on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 347-368, April.
  6. Shioura, Akiyoshi & Shakhlevich, Natalia V. & Strusevich, Vitaly A., 2018. "Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches," European Journal of Operational Research, Elsevier, vol. 266(3), pages 795-818.
  7. Richard L. Daniels & Robert J. Chambers, 1990. "Multiobjective flow‐shop scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 981-995, December.
  8. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
  9. Carrasco, Rodrigo A. & Iyengar, Garud & Stein, Cliff, 2018. "Resource cost aware scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 621-632.
  10. Daniel Ng, C. T. & Cheng, T. C. Edwin & Kovalyov, Mikhail Y., 2004. "Single machine batch scheduling with jointly compressible setup and processing times," European Journal of Operational Research, Elsevier, vol. 153(1), pages 211-219, February.
  11. Dvir Shabtay & George Steiner, 2007. "Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine," Manufacturing & Service Operations Management, INFORMS, vol. 9(3), pages 332-350, March.
  12. Lee, Sang M. & Asllani, Arben A., 2004. "Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming," Omega, Elsevier, vol. 32(2), pages 145-153, April.
  13. Mohri, Shintaro & Masuda, Teruo & Ishii, Hiroaki, 1999. "Bi-criteria scheduling problem on three identical parallel machines," International Journal of Production Economics, Elsevier, vol. 60(1), pages 529-536, April.
  14. Wang, Ji-Bo & Xia, Zun-Quan, 2007. "Single machine scheduling problems with controllable processing times and total absolute differences penalties," European Journal of Operational Research, Elsevier, vol. 177(1), pages 638-645, February.
  15. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
  16. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
  17. Lingfa Lu & Liqi Zhang, 2023. "Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-17, August.
  18. Cheng, T. C. E. & Oguz, C. & Qi, X. D., 1996. "Due-date assignment and single machine scheduling with compressible processing times," International Journal of Production Economics, Elsevier, vol. 43(1), pages 29-35, May.
  19. Dhaenens-Flipo, Clarisse, 2001. "A bicriterion approach to deal with a constrained single-objective problem," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 93-101, December.
  20. Wan, Guohua & Vakati, Sudheer R. & Leung, Joseph Y.-T. & Pinedo, Michael, 2010. "Scheduling two agents with controllable processing times," European Journal of Operational Research, Elsevier, vol. 205(3), pages 528-539, September.
  21. 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.
  22. T.C.E. Cheng & Zhi‐Long Chen & Chung‐Lun Li & B.M.‐T. Lin, 1998. "Scheduling to minimize the total compression and late costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(1), pages 67-82, February.
  23. Neppalli, Venkata Ranga & Chen, Chuen-Lung & Gupta, Jatinder N. D., 1996. "Genetic algorithms for the two-stage bicriteria flowshop problem," European Journal of Operational Research, Elsevier, vol. 95(2), pages 356-373, December.
  24. Gurel, Sinan & Akturk, M. Selim, 2007. "Optimal allocation and processing time decisions on non-identical parallel CNC machines: [epsilon]-constraint approach," European Journal of Operational Research, Elsevier, vol. 183(2), pages 591-607, December.
  25. Shabtay, Dvir & Kaspi, Moshe, 2006. "Parallel machine scheduling with a convex resource consumption function," European Journal of Operational Research, Elsevier, vol. 173(1), pages 92-107, August.
  26. Dvir Shabtay & Moshe Kaspi, 2006. "Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(3), pages 204-216, April.
  27. Yedidsion, Liron & Shabtay, Dvir & Korach, Ephraim & Kaspi, Moshe, 2009. "A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine," International Journal of Production Economics, Elsevier, vol. 119(2), pages 298-307, June.
  28. Cheng, T. C. E. & Oguz, C. & Qi, X. D., 1996. "Due-date assignment and single machine scheduling with compressible processing times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 107-113, June.
  29. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
  30. Shabtay, Dvir & Bensoussan, Yaron & Kaspi, Moshe, 2012. "A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system," International Journal of Production Economics, Elsevier, vol. 136(1), pages 67-74.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.