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

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

Author

Listed:
  • Cheng, T. C. Edwin
  • Shakhlevich, Natalia V.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:2:p:444-456
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00252-8
    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. Sushil K. Gupta & Tapan Sen, 1984. "Note---On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure," Management Science, INFORMS, vol. 30(5), pages 644-647, May.
    2. Szwarc, Wlodzimierz & Mukhopadhyay, Samar K., 1996. "Solution of the generalized Townsend single machine scheduling model," European Journal of Operational Research, Elsevier, vol. 91(1), pages 203-210, May.
    3. W. Townsend, 1978. "The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution," Management Science, INFORMS, vol. 24(5), pages 530-534, January.
    4. Maurice Queyranne & Yaoguang Wang, 1991. "Single-Machine Scheduling Polyhedra with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 1-20, February.
    5. Michael H. Rothkopf & Stephen A. Smith, 1984. "Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs," Operations Research, INFORMS, vol. 32(2), pages 451-456, April.
    6. Sartaj Sahni, 1979. "Preemptive Scheduling with Due Dates," Operations Research, INFORMS, vol. 27(5), pages 925-934, October.
    7. P. C. Bagga & K. R. Kalra, 1980. "Note---A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem," Management Science, INFORMS, vol. 26(6), pages 633-636, June.
    8. Clyde L. Monma & Jeffrey B. Sidney, 1987. "Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 22-31, February.
    9. Federico Della Croce & Wlodzimierz Szwarc & Roberto Tadei & Paolo Baracco & Raffaele di Tullio, 1995. "Minimizing the weighted sum of quadratic completion times on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1263-1270, December.
    10. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    11. Wlodzimierz Szwarc & Marc E. Posner & John J. Liu, 1988. "The Single Machine Problem with a Quadratic Cost Function of Completion Times," Management Science, INFORMS, vol. 34(12), pages 1480-1488, December.
    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. Mondal, Sakib A. & Sen, Anup K., 2000. "An improved precedence rule for single machine sequencing problems with quadratic penalty," European Journal of Operational Research, Elsevier, vol. 125(2), pages 425-428, September.
    2. Schaller, Jeffrey, 2002. "Minimizing the sum of squares lateness on a single machine," European Journal of Operational Research, Elsevier, vol. 143(1), pages 64-79, November.
    3. Janiak, Adam & Krysiak, Tomasz & Pappis, Costas P. & Voutsinas, Theodore G., 2009. "A scheduling problem with job values given as a power function of their completion times," European Journal of Operational Research, Elsevier, vol. 193(3), pages 836-848, March.
    4. Szwarc, Wlodzimierz & Mukhopadhyay, Samar K., 1996. "Solution of the generalized Townsend single machine scheduling model," European Journal of Operational Research, Elsevier, vol. 91(1), pages 203-210, May.
    5. Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
    6. 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.
    7. 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.
    8. Nikhil Bansal & Christoph Dürr & Nguyen Kim Thang & Óscar C. Vásquez, 2017. "The local–global conjecture for scheduling with non-linear cost," Journal of Scheduling, Springer, vol. 20(3), pages 239-254, June.
    9. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    10. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    11. Federico Della Croce & Wlodzimierz Szwarc & Roberto Tadei & Paolo Baracco & Raffaele di Tullio, 1995. "Minimizing the weighted sum of quadratic completion times on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1263-1270, December.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Fanjul-Peyro, Luis & Perea, Federico & Ruiz, Rubén, 2017. "Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources," European Journal of Operational Research, Elsevier, vol. 260(2), pages 482-493.
    17. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    18. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
    19. Tao Ren & Yan Zhang & Shuenn-Ren Cheng & Chin-Chia Wu & Meng Zhang & Bo-yu Chang & Xin-yue Wang & Peng Zhao, 2020. "Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates," Mathematics, MDPI, vol. 8(8), pages 1-25, July.
    20. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).

    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:165:y:2005:i:2:p:444-456. 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.