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

Multiple and bicriteria scheduling: A literature survey

Author

Listed:
  • Nagar, Amit
  • Haddock, Jorge
  • Heragu, Sunderesh

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:1:p:88-104
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0140-S
    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. Slowinski, Roman, 1981. "Multiobjective network scheduling with efficient use of renewable and nonrenewable resources," European Journal of Operational Research, Elsevier, vol. 7(3), pages 265-273, July.
    2. Thomas L. Morin & Roy E. Marsten, 1976. "Branch-and-Bound Strategies for Dynamic Programming," Operations Research, INFORMS, vol. 24(4), pages 611-627, August.
    3. Harold H. Greenberg, 1968. "A Branch-Bound Solution to the General Scheduling Problem," Operations Research, INFORMS, vol. 16(2), pages 353-361, April.
    4. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    5. Van Wassenhove, Luk N. & Baker, Kenneth R., 1982. "A bicriterion approach to time/cost trade-offs in sequencing," European Journal of Operational Research, Elsevier, vol. 11(1), pages 48-54, September.
    6. J. Wesley Barnes & Lawrence K. Vanston, 1981. "Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs," Operations Research, INFORMS, vol. 29(1), pages 146-160, February.
    7. Van Wassenhove, L. & Gelders, L., 1978. "Four solution techniques for a general one machine scheduling problem : A comparative study," European Journal of Operational Research, Elsevier, vol. 2(4), pages 281-290, July.
    8. R. G. Vickson, 1980. "Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine," Operations Research, INFORMS, vol. 28(5), pages 1155-1167, October.
    9. Fry, TD & Armstrong, RD & Lewis, H, 1989. "A framework for single machine multiple objective sequencing research," Omega, Elsevier, vol. 17(6), pages 595-607.
    10. Bansal, S. P., 1980. "Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 5(3), pages 177-181, September.
    11. Lawrence M. Wein & Philippe B. Chevalier, 1992. "A Broader View of the Job-Shop Scheduling Problem," Management Science, INFORMS, vol. 38(7), pages 1018-1033, July.
    12. Rosser T. Nelson & Rakesh K. Sarin & Richard L. Daniels, 1986. "Scheduling with Multiple Performance Measures: The One-Machine Case," Management Science, INFORMS, vol. 32(4), pages 464-479, April.
    13. Tapan Sen & Farhad M. E. Raiszadeh & Parthasarati Dileepan, 1988. "Note---A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness," Management Science, INFORMS, vol. 34(2), pages 254-260, February.
    14. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    15. Edward H. Bowman, 1959. "The Schedule-Sequencing Problem," Operations Research, INFORMS, vol. 7(5), pages 621-624, October.
    16. Daniels, Richard L., 1990. "A multi-objective approach to resource allocation in single machine scheduling," European Journal of Operational Research, Elsevier, vol. 48(2), pages 226-241, September.
    17. Dileepan, P & Sen, T, 1988. "Bicriterion static scheduling research for a single machine," Omega, Elsevier, vol. 16(1), pages 53-59.
    18. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    19. Norbis, Mario I. & MacGregor Smith, J., 1988. "A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems," European Journal of Operational Research, Elsevier, vol. 33(1), pages 30-41, January.
    20. Frieze, A. M. & Yadegar, J., 1989. "A new integer programming formulation for the permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 40(1), pages 90-98, May.
    21. 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.
    22. Dileepan, Parthasarati & Sen, Tapan, 1991. "Bicriterion jobshop scheduling with total flowtime and sum of squared lateness," Engineering Costs and Production Economics, Elsevier, vol. 21(3), pages 295-299, July.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. 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.
    4. 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.
    5. Norbis, Mario & MacGregor Smith, J., 1996. "An interactive decision support system for the resource Constrained Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 94(1), pages 54-65, October.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Carrasco, Rodrigo A. & Iyengar, Garud & Stein, Cliff, 2018. "Resource cost aware scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 621-632.
    11. T'kindt, V. & Billaut, J-C. & Proust, C., 2001. "Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry," European Journal of Operational Research, Elsevier, vol. 135(1), pages 42-49, November.
    12. Chen, Wei-Yang & Sheen, Gwo-Ji, 2007. "Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 214-229, September.
    13. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    14. 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.
    15. 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.
    16. 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.
    17. Guner, Ertan & Erol, Serpil & Tani, Kazuo, 1998. "One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 55(2), pages 213-219, July.
    18. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. 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.
    20. 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.

    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:81:y:1995:i:1:p:88-104. 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.