IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v70y1993i1p115-125.html
   My bibliography  Save this article

Complexity of single machine, multi-criteria scheduling problems

Author

Listed:
  • Chen, Chuen-Lung
  • Bulfin, Robert L.

Abstract

No abstract is available for this item.

Suggested Citation

  • Chen, Chuen-Lung & Bulfin, Robert L., 1993. "Complexity of single machine, multi-criteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 70(1), pages 115-125, October.
    • Handle: RePEc:eee:ejores:v:70:y:1993:i:1:p:115-125
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)90236-G
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    2. Mosheiov, Gur, 2005. "Minimizing total completion time and total deviation of job completion times from a restrictive due-date," European Journal of Operational Research, Elsevier, vol. 165(1), pages 20-33, August.
    3. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    4. Loukil, T. & Teghem, J. & Tuyttens, D., 2005. "Solving multi-objective production scheduling problems using metaheuristics," European Journal of Operational Research, Elsevier, vol. 161(1), pages 42-61, February.
    5. Wan, Guohua & Yen, Benjamin P.-C., 2009. "Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 195(1), pages 89-97, May.
    6. Gupta, J.N.D. & Ruiz-Torres, Alex J., 2005. "Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 679-695, December.
    7. Ruiz-Torres, Alex J. & Ho, Johnny C. & Lopez, Francisco J., 2006. "Generating Pareto schedules with outsource and internal parallel resources," International Journal of Production Economics, Elsevier, vol. 103(2), pages 810-825, October.
    8. 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.
    9. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    10. Mosheiov, Gur, 2004. "Simultaneous minimization of total completion time and total deviation of job completion times," European Journal of Operational Research, Elsevier, vol. 157(2), pages 296-306, September.
    11. 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.
    12. J N D Gupta & A J Ruiz-torres & S Webster, 2003. "Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1263-1274, December.
    13. Sivrikaya-Serifoglu, Funda & Ulusoy, Gunduz, 1998. "A bicriteria two-machine permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 414-430, June.
    14. Subhash C. Sarin & Divya Prakash, 2004. "Equal Processing Time Bicriteria Scheduling on Parallel Machines," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 227-240, September.
    15. 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.
    16. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    17. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
    18. Li, Wenhua & Yuan, Jinjiang, 2006. "Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost," International Journal of Production Economics, Elsevier, vol. 102(1), pages 143-148, July.
    19. Gupta, Jatinder N. D. & Ruiz-Torres, Alex J., 2000. "Minimizing makespan subject to minimum total flow-time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 125(2), pages 370-380, September.
    20. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    21. Koksalan Kondakci, Suna & Bekiroglu, Tuncay, 1997. "Scheduling with bicriteria: total flowtime and number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 53(1), pages 91-99, November.
    22. Huo, Yumei & Leung, Joseph Y.-T. & Zhao, Hairong, 2007. "Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 116-134, February.
    23. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:70:y:1993:i:1:p:115-125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.