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

Mean flow time minimization with given bounds of processing times

Author

Listed:
  • Lai, Tsung-Chyan
  • Sotskov, Yuri N.
  • Sotskova, Nadezhda
  • Werner, Frank

Abstract

No abstract is available for this item.

Suggested Citation

  • Lai, Tsung-Chyan & Sotskov, Yuri N. & Sotskova, Nadezhda & Werner, Frank, 2004. "Mean flow time minimization with given bounds of processing times," European Journal of Operational Research, Elsevier, vol. 159(3), pages 558-573, December.
    • Handle: RePEc:eee:ejores:v:159:y:2004:i:3:p:558-573
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00424-7
    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. Sotskov, Y. & Sotskova, N. Y. & Werner, F., 1997. "Stability of an optimal schedule in a job shop," Omega, Elsevier, vol. 25(4), pages 397-414, August.
    2. Chung-Yee Lee & Lei Lei & Michael Pinedo, 1997. "Current trends in deterministic scheduling," Annals of Operations Research, Springer, vol. 70(0), pages 1-41, April.
    3. H. Bräsel & M. Harborth & T. Tautenhahn & P. Willenius, 1999. "On the set of solutions of the open shop problem," Annals of Operations Research, Springer, vol. 92(0), pages 241-263, 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. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    2. Lai, Tsung-Chyan & Sotskov, Yuri N. & Dolgui, Alexandre, 2019. "The stability radius of an optimal line balance with maximum efficiency for a simple assembly line," European Journal of Operational Research, Elsevier, vol. 274(2), pages 466-481.

    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. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    2. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    3. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.
    4. 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.
    5. Kumar, Subodha & Dutta, Kaushik & Mookerjee, Vijay, 2009. "Maximizing business value by optimal assignment of jobs to resources in grid computing," European Journal of Operational Research, Elsevier, vol. 194(3), pages 856-872, May.
    6. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    7. 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.
    8. Huang, Wei & Chen, Bo, 2007. "Scheduling of batch plants: Constraint-based approach and performance investigation," International Journal of Production Economics, Elsevier, vol. 105(2), pages 425-444, February.
    9. Michael Andresen & Tanka Dhamala, 2012. "New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan," Annals of Operations Research, Springer, vol. 196(1), pages 1-26, July.
    10. Oguz, Ceyda & Zinder, Yakov & Ha Do, Van & Janiak, Adam & Lichtenstein, Maciej, 2004. "Hybrid flow-shop scheduling problems with multiprocessor task systems," European Journal of Operational Research, Elsevier, vol. 152(1), pages 115-131, January.
    11. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    12. Lee, C. -Y. & Leon, V. J., 2001. "Machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 128(1), pages 119-128, January.
    13. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    14. Sotskov, Y.N. & Wagelmans, A.P.M. & Werner, F., 1997. "On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule," Econometric Institute Research Papers EI 9718/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
    16. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    17. Navid Hashemian & Claver Diallo & Béla Vizvári, 2014. "Makespan minimization for parallel machines scheduling with multiple availability constraints," Annals of Operations Research, Springer, vol. 213(1), pages 173-186, February.
    18. Emir Hüseyin Özder & Evrencan Özcan & Tamer Eren, 2019. "Staff Task-Based Shift Scheduling Solution with an ANP and Goal Programming Method in a Natural Gas Combined Cycle Power Plant," Mathematics, MDPI, vol. 7(2), pages 1-26, February.
    19. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    20. George L. Vairaktarakis & Chung‐Yee Lee, 2004. "Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 44-59, 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:159:y:2004:i:3:p:558-573. 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.