interval processing times Latest Research Papers

Robust (min–max regret) single machine scheduling with interval processing times and total tardiness criterion

Computers & Industrial Engineering ◽

10.1016/j.cie.2020.106838 ◽

2020 ◽

Vol 149 ◽

pp. 106838

Author(s):

Shijin Wang ◽

Wenli Cui ◽

Feng Chu ◽

Jianbo Yu ◽

Jatinder N.D. Gupta

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Tardiness ◽

Processing Times ◽

Interval Processing Times

Download Full-text

Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times

Annals of Operations Research ◽

10.1007/s10479-019-03263-6 ◽

2019 ◽

Vol 284 (1) ◽

pp. 263-282 ◽

Cited By ~ 1

Author(s):

Maciej Drwal ◽

Jerzy Józefczyk

Keyword(s):

Processing Times ◽

Weighted Number ◽

Number Of Late Jobs ◽

Late Jobs ◽

Interval Processing Times

Download Full-text

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective

Algorithms ◽

10.3390/a11050066 ◽

2018 ◽

Vol 11 (5) ◽

pp. 66 ◽

Cited By ~ 6

Author(s):

Yuri Sotskov ◽

Natalja Egorova

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Completion Time ◽

Scheduling Problem ◽

Processing Times ◽

Interval Processing Times

Download Full-text

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times

Central European Journal of Operations Research ◽

10.1007/s10100-017-0485-8 ◽

2017 ◽

Vol 26 (1) ◽

pp. 215-238 ◽

Cited By ~ 5

Author(s):

Michał Ćwik ◽

Jerzy Józefczyk

Keyword(s):

Heuristic Algorithms ◽

Flow Shop ◽

Processing Times ◽

Minmax Regret ◽

Flow Shop Problem ◽

Interval Processing Times

Download Full-text

Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times

International Journal of Production Research ◽

10.1080/00207543.2016.1162341 ◽

2016 ◽

Vol 54 (12) ◽

pp. 3706-3717 ◽

Cited By ~ 28

Author(s):

Xin Feng ◽

Feifeng Zheng ◽

Yinfeng Xu

Keyword(s):

Flow Shop ◽

Hybrid Flow Shop ◽

Two Stage ◽

Robust Scheduling ◽

Processing Times ◽

Interval Processing Times

Download Full-text

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Computers & Operations Research ◽

10.1016/j.cor.2015.08.010 ◽

2016 ◽

Vol 66 ◽

pp. 141-152 ◽

Cited By ~ 20

Author(s):

Jordi Pereira

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Processing Times ◽

Minmax Regret ◽

Weighted Completion Time ◽

Interval Processing Times

Download Full-text

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

Computers & Operations Research ◽

10.1016/j.cor.2014.06.003 ◽

2014 ◽

Vol 51 ◽

pp. 200-207 ◽

Cited By ~ 18

Author(s):

Ali Allahverdi ◽

Harun Aydilek ◽

Asiye Aydilek

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Scheduling Problem ◽

Processing Times ◽

Weighted Completion Time ◽

Interval Processing Times

Download Full-text

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

Annals of Operations Research ◽

10.1007/s10479-014-1538-1 ◽

2014 ◽

Vol 222 (1) ◽

pp. 517-533 ◽

Cited By ~ 5

Author(s):

Marcin Siepak ◽

Jerzy Józefczyk

Keyword(s):

Flow Time ◽

Scheduling Problem ◽

Total Flow ◽

Unrelated Machines ◽

Total Flow Time ◽

Processing Times ◽

Solution Algorithms ◽

Time Criterion ◽

Minmax Regret ◽

Interval Processing Times

Download Full-text

Measures of problem uncertainty for scheduling with interval processing times

OR Spectrum ◽

10.1007/s00291-012-0306-3 ◽

2012 ◽

Vol 35 (3) ◽

pp. 659-689 ◽

Cited By ~ 16

Author(s):

Yuri N. Sotskov ◽

Tsung-Chyan Lai ◽

Frank Werner

Keyword(s):

Processing Times ◽

Interval Processing Times

Download Full-text

Uncertainty measure for the Bellman–Johnson problem with interval processing times

Cybernetics and Systems Analysis ◽

10.1007/s10559-012-9445-4 ◽

2012 ◽

Vol 48 (5) ◽

pp. 641-652 ◽

Cited By ~ 3

Author(s):

Yu. N. Sotskova ◽

N. M. Matsveichuka

Keyword(s):

Uncertainty Measure ◽

Processing Times ◽

Johnson Problem ◽

Interval Processing Times

Download Full-text

interval processing times
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

Robust (min–max regret) single machine scheduling with interval processing times and total tardiness criterion

Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times

Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

Measures of problem uncertainty for scheduling with interval processing times

Uncertainty measure for the Bellman–Johnson problem with interval processing times

Export Citation Format

interval processing timesRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

Robust (min–max regret) single machine scheduling with interval processing times and total tardiness criterion

Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times

Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

Measures of problem uncertainty for scheduling with interval processing times

Uncertainty measure for the Bellman–Johnson problem with interval processing times

interval processing times
Recently Published Documents