Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion-Reference-Cited by-同舟云学术

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Published:2005-07 Issue:4 Volume:33 Page:431-436
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Kasperski Adam

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference7 articles.

1. Minmax regret solutions for minimax optimization problems with uncertainty;Averbakh;Oper. Res. Lett.,2000

2. Scheduling Algorithms, Second Revised and Enlarged Edition;Brucker,1998

3. Robust scheduling to hedge against processing time uncertainty in single-stage production;Daniels;Management Sci.,1995

4. P. Kouvelis, R.L. Daniels, G. Vairaktarakis, Robust scheduling of a two-machine flow shop with uncertain processing times, Working Paper, Fuqua School of Business, Duke University, 1996.

5. Robust Discrete Optimization and its Applications;Kouvelis,1997

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

1. Min–max relative regret for scheduling to minimize maximum lateness;Annals of Operations Research;2024-07-05

2. Other Combinatorial Problems;International Series in Operations Research & Management Science;2024

3. Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems;European Journal of Operational Research;2023-05

4. Robust Optimization on Unrelated Parallel Machine Scheduling With Setup Times;IEEE Transactions on Automation Science and Engineering;2023-01

5. Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness;Lecture Notes in Computer Science;2023