Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem-Reference-Cited by-同舟云学术

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

Published:2007-08 Issue:1 Volume:181 Page:266-287
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Soroush H.M.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference29 articles.

1. The single-machine absolute-deviation early–tardy problem with random completion times;Al-Turki;Naval Research Logistics,1996

2. Introduction to Sequencing and Scheduling;Baker,1974

3. Elements of Sequencing and Scheduling;Baker,1995

4. Sequencing with earliness and tardiness penalties: A review;Baker;Operations Research,1990

5. Scheduling to minimize the number of late jobs when set-up and processing times are uncertain;Balut;Management Science,1973

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Single machine scheduling with release dates: A distributionally robust approach;European Journal of Operational Research;2023-07

2. Due-date assignment scheduling with only mean and support of processing times;International Journal of Production Research;2023-03-30

3. A Review of Robust Machine Scheduling;IEEE Transactions on Automation Science and Engineering;2023

4. Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times;Hacettepe Journal of Mathematics and Statistics;2022-12-31

5. Target-based distributionally robust optimization for single machine scheduling;European Journal of Operational Research;2022-06