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

A time-dependent multiple criteria single-machine scheduling problem

Author

Listed:
  • Klamroth, Kathrin
  • Wiecek, Margaret M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Klamroth, Kathrin & Wiecek, Margaret M., 2001. "A time-dependent multiple criteria single-machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 135(1), pages 17-26, November.
    • Handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:17-26
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00286-1
    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. Teng, Junn-Yuan & Tzeng, Gwo-Hshiung, 1996. "A multiobjective programming approach for selecting non-independent transportation investment alternatives," Transportation Research Part B: Methodological, Elsevier, vol. 30(4), pages 291-307, August.
    2. S. Thomas McCormick, 1999. "Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow," Operations Research, INFORMS, vol. 47(5), pages 744-756, October.
    3. Kwak, Wikil & Shi, Yong & Lee, Heeseok & Lee, Cheng F., 1996. "Capital Budgeting with Multiple Criteria and Multiple Decision Makers," Review of Quantitative Finance and Accounting, Springer, vol. 7(1), pages 97-112, July.
    4. B Alidaee & N K Womer, 1999. "Scheduling with time dependent processing times: Review and extensions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 711-720, July.
    5. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    6. J. A. Hoogeveen, 1996. "Minimizing Maximum Promptness and Maximum Lateness on a Single Machine," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 100-114, February.
    7. André Gascon & Robert C. Leachman, 1988. "A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem," Operations Research, INFORMS, vol. 36(1), pages 50-56, February.
    8. 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.
    9. SOUSA, Jorge P. & WOLSEY, Laurence A., 1992. "A time indexed formulation of non-preemptive single machine scheduling problems," LIDAM Reprints CORE 984, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    2. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.

    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. Kathrin Klamroth & Margaret M. Wiecek, 2000. "Dynamic programming approaches to the multiple criteria knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 57-76, February.
    2. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    3. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    4. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    5. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    6. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    7. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    8. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    9. Abdessamad Ait El Cadi & Omar Souissi & Rabie Ben Atitallah & Nicolas Belanger & Abdelhakim Artiba, 2018. "Mathematical programming models for scheduling in a CPU/FPGA architecture with heterogeneous communication delays," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 629-640, March.
    10. Wei Zhang & Sriram Dasu & Reza Ahmadi, 2017. "Higher Prices for Larger Quantities? Nonmonotonic Price–Quantity Relations in B2B Markets," Management Science, INFORMS, vol. 63(7), pages 2108-2126, July.
    11. Sanjeev Swami & Jehoshua Eliashberg & Charles B. Weinberg, 1999. "SilverScreener: A Modeling Approach to Movie Screens Management," Marketing Science, INFORMS, vol. 18(3), pages 352-372.
    12. Diego Muñoz-Carpintero & Doris Sáez & Cristián E. Cortés & Alfredo Núñez, 2015. "A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach," Transportation Science, INFORMS, vol. 49(2), pages 239-253, May.
    13. Shi, Yong, 1998. "Optimal system design with MC2 linear programming: A dual contingency plan approach," European Journal of Operational Research, Elsevier, vol. 107(3), pages 692-709, June.
    14. Keumseok Kang & J. George Shanthikumar & Kemal Altinkemer, 2016. "Postponable Acceptance and Assignment: A Stochastic Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 493-508, October.
    15. Balasubramanian, Hari & Fowler, John & Keha, Ahmet & Pfund, Michele, 2009. "Scheduling interfering job sets on parallel machines," European Journal of Operational Research, Elsevier, vol. 199(1), pages 55-67, November.
    16. Chang, Yu-Hern & Yeh, Chung-Hsing & Shen, Ching-Cheng, 2000. "A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 91-106, February.
    17. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    18. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    19. Kalyan Talluri & Garrett van Ryzin, 2000. "Revenue management under general discrete choice model of consumer behavior," Economics Working Papers 533, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 2001.
    20. Pak, K. & Piersma, N., 2002. "airline revenue management," ERIM Report Series Research in Management ERS-2002-12-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:135:y:2001:i:1:p:17-26. 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.