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

Preemptive multiprocessor order scheduling to minimize total weighted flowtime

Author

Listed:
  • Leung, Joseph Y.-T.
  • Lee, C.Y.
  • Ng, C.W.
  • Young, G.H.

Abstract

Consider m identical machines in parallel, each of which can produce k different product types. There is no setup cost when the machines switch from producing one product type to another. There are n orders each of which requests various quantities of the different product types. All orders are available for processing at time t = 0, and preemption is allowed. Order i has a weight wi and its completion time is the time when its last requested product type finishes. Our goal is to find a preemptive schedule such that the total weighted completion time [summation operator]wiCi is minimized. We show that this problem is NP-hard even when all jobs have identical weights and there are only two machines. Motivated by the computational complexity of the problem, we propose a simple heuristic and show that it obeys a worst-case bound of 2 - 1/m. Finally, empirical studies show that our heuristic performs very well when compared with a lower bound of the optimal cost.

Suggested Citation

  • Leung, Joseph Y.-T. & Lee, C.Y. & Ng, C.W. & Young, G.H., 2008. "Preemptive multiprocessor order scheduling to minimize total weighted flowtime," European Journal of Operational Research, Elsevier, vol. 190(1), pages 40-51, October.
    • Handle: RePEc:eee:ejores:v:190:y:2008:i:1:p:40-51
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00529-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. Chang Sup Sung & Sang Hum Yoon, 1998. "Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines," International Journal of Production Economics, Elsevier, vol. 54(3), pages 247-255, May.
    3. A.E. Gerodimos & C.A. Glass & C.N. Potts & T. Tautenhahn, 1999. "Scheduling multi‐operation jobs on a single machine," Annals of Operations Research, Springer, vol. 92(0), pages 87-105, January.
    4. Leung, Joseph Y-T. & Li, Haibing & Pinedo, Michael & Sriskandarajah, Chelliah, 2005. "Open shops with jobs overlap--revisited," European Journal of Operational Research, Elsevier, vol. 163(2), pages 569-571, June.
    5. Edward G. Coffman & Ardavan Nozari & Mihalis Yannakakis, 1989. "Optimal Scheduling of Products with Two Subassemblies on a Single Machine," Operations Research, INFORMS, vol. 37(3), pages 426-436, June.
    6. Jatinder Gupta & Johnny Ho & Jack van der Veen, 1997. "Single machine hierarchical scheduling with customer orders and multiple job classes," Annals of Operations Research, Springer, vol. 70(0), pages 127-143, April.
    7. Wagneur, E. & Sriskandarajah, C., 1993. "Openshops with jobs overlap," European Journal of Operational Research, Elsevier, vol. 71(3), pages 366-378, December.
    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. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    3. Lee, Ik Sun, 2013. "Minimizing total tardiness for the order scheduling problem," International Journal of Production Economics, Elsevier, vol. 144(1), pages 128-134.

    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. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    2. Wang, Guoqing & Cheng, T.C. Edwin, 2007. "Customer order scheduling to minimize total weighted completion time," Omega, Elsevier, vol. 35(5), pages 623-626, October.
    3. Leung, Joseph Y-T. & Li, Haibing & Pinedo, Michael & Sriskandarajah, Chelliah, 2005. "Open shops with jobs overlap--revisited," European Journal of Operational Research, Elsevier, vol. 163(2), pages 569-571, June.
    4. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    5. T.C. Edwin Cheng & Qingqin Nong & Chi To Ng, 2011. "Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 763-770, December.
    6. Reza Ahmadi & Uttarayan Bagchi & Thomas A. Roemer, 2005. "Coordinated scheduling of customer orders for quick response," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 493-512, September.
    7. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
    8. B. M. T. Lin & T. C. E. Cheng, 2011. "Scheduling with centralized and decentralized batching policies in concurrent open shops," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(1), pages 17-27, February.
    9. Yoon, Sang Hum & Sung, Chang Sup, 2005. "Fixed pre-assembly scheduling on multiple fabrication machines," International Journal of Production Economics, Elsevier, vol. 96(1), pages 109-118, April.
    10. Leung, Joseph Y.-T. & Li, Haibing & Pinedo, Michael, 2006. "Scheduling orders for multiple product types with due date related objectives," European Journal of Operational Research, Elsevier, vol. 168(2), pages 370-389, January.
    11. Gerodimos, Alex E. & Glass, Celia A. & Potts, Chris N., 2000. "Scheduling the production of two-component jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 120(2), pages 250-259, January.
    12. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    13. Gur Mosheiov & Daniel Oron, 2023. "A note on batch scheduling on a two-machine flowshop with machine-dependent processing times," 4OR, Springer, vol. 21(3), pages 457-469, September.
    14. Ji, Min & He, Yong & Cheng, T.C.E., 2007. "Batch delivery scheduling with batch delivery cost on a single machine," European Journal of Operational Research, Elsevier, vol. 176(2), pages 745-755, January.
    15. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    16. Joseph Leung & Haibing Li & Michael Pinedo, 2008. "Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time," Annals of Operations Research, Springer, vol. 159(1), pages 107-123, March.
    17. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    18. Bolat, Ahmet, 1997. "Sequencing jobs for an automated manufacturing module with buffer," European Journal of Operational Research, Elsevier, vol. 96(3), pages 622-635, February.
    19. Framinan, Jose M. & Perez-Gonzalez, Paz, 2018. "Order scheduling with tardiness objective: Improved approximate solutions," European Journal of Operational Research, Elsevier, vol. 266(3), pages 840-850.
    20. 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.

    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:190:y:2008:i:1:p:40-51. 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.