IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v60-61y1999i1p529-536.html
   My bibliography  Save this article

Bi-criteria scheduling problem on three identical parallel machines

Author

Listed:
  • Mohri, Shintaro
  • Masuda, Teruo
  • Ishii, Hiroaki

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:60-61:y:1999:i:1:p:529-536
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(98)00166-2
    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. Sartaj Sahni, 1979. "Preemptive Scheduling with Due Dates," Operations Research, INFORMS, vol. 27(5), pages 925-934, October.
    2. 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.
    3. S. Thomas McCormick & Michael L. Pinedo, 1995. "Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 63-77, February.
    4. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    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. 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.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.

    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. 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.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. Qian, Fubin & Strusevich, Vitaly & Gribkovskaia, Irina & Halskau, Øyvind, 2015. "Minimization of passenger takeoff and landing risk in offshore helicopter transportation: Models, approaches and analysis," Omega, Elsevier, vol. 51(C), pages 93-106.
    4. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    5. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2020. "Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost," Journal of Global Optimization, Springer, vol. 76(3), pages 471-490, March.
    6. 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.
    7. 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.
    8. Cheng, T. C. Edwin & Shakhlevich, Natalia V., 2005. "Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 444-456, September.
    9. S. Knust & N. V. Shakhlevich & S. Waldherr & C. Weiß, 2019. "Shop scheduling problems with pliable jobs," Journal of Scheduling, Springer, vol. 22(6), pages 635-661, December.
    10. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    11. 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.
    12. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    13. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    14. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    17. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    18. 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.
    19. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    20. 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.

    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:proeco:v:60-61:y:1999:i:1:p:529-536. 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/ijpe .

    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.