Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Imed Kacem; Hans Kellerer

doi:10.1007/s00453-018-0417-6

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Algorithmica ◽

10.1007/s00453-018-0417-6 ◽

2018 ◽

Vol 80 (12) ◽

pp. 3825-3843 ◽

Cited By ~ 3

Author(s):

Imed Kacem ◽

Hans Kellerer

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Approximation Schemes ◽

Release Times ◽

Deadline Constraints

Download Full-text

Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-319-14115-2_26 ◽

2014 ◽

pp. 305-314 ◽

Cited By ~ 1

Author(s):

Imed Kacem ◽

Hans Kellerer ◽

Maryam Seifaddini

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Approximation Schemes ◽

Efficient Approximation

Download Full-text

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval

Journal of Combinatorial Optimization ◽

10.1007/s10878-015-9924-4 ◽

2015 ◽

Vol 32 (3) ◽

pp. 970-981 ◽

Cited By ~ 6

Author(s):

Imed Kacem ◽

Hans Kellerer ◽

Maryam Seifaddini

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Approximation Schemes ◽

Efficient Approximation

Download Full-text

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Lecture Notes in Computer Science - Computational Logistics ◽

10.1007/978-3-030-00898-7_28 ◽

2018 ◽

pp. 417-427

Author(s):

Imed Kacem ◽

Hans Kellerer

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Maximum Lateness ◽

Approximation Schemes

Download Full-text

Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-319-09174-7_26 ◽

2014 ◽

pp. 305-314 ◽

Cited By ~ 1

Author(s):

Imed Kacem ◽

Hans Kellerer ◽

Maryam Seifaddini

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Approximation Schemes ◽

Efficient Approximation

Download Full-text

A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Computers & Operations Research ◽

10.1016/j.cor.2011.12.014 ◽

2012 ◽

Vol 39 (10) ◽

pp. 2346-2358 ◽

Cited By ~ 11

Author(s):

Veronique Sels ◽

Mario Vanhoucke

Keyword(s):

Genetic Algorithm ◽

Single Machine ◽

Hybrid Genetic Algorithm ◽

Maximum Lateness ◽

Release Times ◽

Family Setups

Download Full-text

Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times

Swarm and Evolutionary Computation ◽

10.1016/j.swevo.2021.100869 ◽

2021 ◽

pp. 100869

Author(s):

Victor Fernandez-Viagas ◽

Antonio Costa

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Population Based ◽

Single Machine Scheduling ◽

Setup Times ◽

Scheduling Problem ◽

Release Times ◽

Sequence Dependent Setup ◽

Dependent Setup Times ◽

Sequence Dependent Setup Times

Download Full-text

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-008-1762-4 ◽

2008 ◽

Vol 43 (7-8) ◽

pp. 810-821 ◽

Cited By ~ 14

Author(s):

Fuh-Der Chou ◽

Hui-Mei Wang ◽

Tzu-Yun Chang

Keyword(s):

Single Machine ◽

Completion Time ◽

Total Weighted Completion Time ◽

Scheduling Problem ◽

Release Times ◽

Sequence Dependent ◽

Time Scheduling ◽

Weighted Completion Time

Download Full-text

Single machine batch scheduling with release times and delivery costs

Journal of Scheduling ◽

10.1007/s10951-011-0255-8 ◽

2011 ◽

Vol 16 (1) ◽

pp. 69-79 ◽

Cited By ~ 14

Author(s):

Esaignani Selvarajah ◽

George Steiner ◽

Rui Zhang

Keyword(s):

Single Machine ◽

Batch Scheduling ◽

Release Times ◽

Delivery Costs

Download Full-text

A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness

IIE Transactions ◽

10.1080/07408178508975300 ◽

1985 ◽

Vol 17 (3) ◽

pp. 252-260 ◽

Cited By ~ 19

Author(s):

R. E. Larson ◽

M. I. Dessouky ◽

R. E. Devor

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Backward Procedure ◽

Machine Problem

Download Full-text

Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

Computers & Operations Research ◽

10.1016/j.cor.2006.10.003 ◽

2008 ◽

Vol 35 (6) ◽

pp. 2018-2033 ◽

Cited By ~ 9

Author(s):

Reha Uzsoy ◽

Juan Diego Velásquez

Keyword(s):

Single Machine ◽

Maximum Lateness ◽

Set Up

Download Full-text