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

Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan

Author

Listed:
  • Toktas, Berkin
  • Azizoglu, Meral
  • Koksalan, Suna Kondakci

Abstract

No abstract is available for this item.

Suggested Citation

  • Toktas, Berkin & Azizoglu, Meral & Koksalan, Suna Kondakci, 2004. "Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan," European Journal of Operational Research, Elsevier, vol. 157(2), pages 286-295, September.
    • Handle: RePEc:eee:ejores:v:157:y:2004:i:2:p:286-295
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00192-9
    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.

    References listed on IDEAS

    as
    1. Sung, C. S. & Min, J. I., 2001. "Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date," European Journal of Operational Research, Elsevier, vol. 131(1), pages 95-106, May.
    2. J. A. Hoogeveen, 1996. "Minimizing Maximum Promptness and Maximum Lateness on a Single Machine," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 100-114, February.
    3. Fry, TD & Armstrong, RD & Lewis, H, 1989. "A framework for single machine multiple objective sequencing research," Omega, Elsevier, vol. 17(6), pages 595-607.
    4. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    5. 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.
    6. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    7. Sayin, Serpil & Karabati, Selcuk, 1999. "A bicriteria approach to the two-machine flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 435-449, March.
    8. 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.
    9. Gupta, Jatinder N. D. & Neppalli, Venkata R. & Werner, Frank, 2001. "Minimizing total flow time in a two-machine flowshop problem with minimum makespan," International Journal of Production Economics, Elsevier, vol. 69(3), pages 323-338, February.
    10. Klein, Dieter & Hannan, Edward, 1982. "An algorithm for the multiple objective integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 9(4), pages 378-385, April.
    11. Van Wassenhove, Luc N. & Gelders, Ludo F., 1980. "Solving a bicriterion scheduling problem," European Journal of Operational Research, Elsevier, vol. 4(1), pages 42-48, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    2. Cheng, Mingbao & Tadikamalla, Pandu R. & Shang, Jennifer & Zhang, Shaqing, 2014. "Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 234(3), pages 650-657.
    3. A. R. Rahimi-Vahed & S. M. Mirghorbani, 2007. "A multi-objective particle swarm for a flow shop scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 79-102, January.
    4. Nouha Nouri & Talel Ladhari, 2018. "Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking," Annals of Operations Research, Springer, vol. 267(1), pages 413-430, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. T'kindt, Vincent & Monmarche, Nicolas & Tercinet, Fabrice & Laugt, Daniel, 2002. "An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 250-257, October.
    3. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    4. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    5. Hesaraki, Alireza F. & Dellaert, Nico P. & de Kok, Ton, 2019. "Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan," European Journal of Operational Research, Elsevier, vol. 275(1), pages 304-318.
    6. 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.
    7. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    8. Allahverdi, Ali, 2003. "The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime," European Journal of Operational Research, Elsevier, vol. 147(2), pages 373-396, June.
    9. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    10. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    11. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    12. N. V. R. Mahadev & Aleksandar Pekeč & Fred S. Roberts, 1998. "On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?," Operations Research, INFORMS, vol. 46(3-supplem), pages 120-134, June.
    13. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    14. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    15. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    16. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    17. 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.
    18. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    19. Framinan, Jose M. & Leisten, Rainer & Ruiz-Usano, Rafael, 2002. "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, Elsevier, vol. 141(3), pages 559-569, September.
    20. Ventura, Jose A. & Kim, Daecheol & Garriga, Frederic, 2002. "Single machine earliness-tardiness scheduling with resource-dependent release dates," European Journal of Operational Research, Elsevier, vol. 142(1), pages 52-69, October.

    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:157:y:2004:i:2:p:286-295. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.