Minmax scheduling problems with common due-date and completion time penalty

Journal of Combinatorial Optimization ◽

10.1007/s10878-018-0365-8 ◽

2018 ◽

Vol 38 (1) ◽

pp. 50-71 ◽

Author(s):

Baruch Mor

Keyword(s):

Completion Time ◽

Scheduling Problems ◽

Due Date ◽

Common Due Date

Download Full-text

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

Operations Research ◽

10.1287/opre.39.5.836 ◽

1991 ◽

Vol 39 (5) ◽

pp. 836-846 ◽

Author(s):

Nicholas G. Hall ◽

Marc E. Posner

Keyword(s):

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Completion Times

Download Full-text

Optimal common due-date with limited completion time deviation

Computers & Operations Research ◽

10.1016/0305-0548(88)90001-9 ◽

1988 ◽

Vol 15 (2) ◽

pp. 91-96 ◽

Author(s):

T.C.E. Cheng

Keyword(s):

Completion Time ◽

Due Date ◽

Common Due Date

Download Full-text

A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX

Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS) ◽

10.4108/icst.bict.2014.257888 ◽

2015 ◽

Author(s):

Shih-Hsin Chen

Keyword(s):

Single Machine ◽

Arrival Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Machine Scheduling Problems

Download Full-text

Minimizing earliness–tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm

Computers & Industrial Engineering ◽

10.1016/j.cie.2008.01.008 ◽

2008 ◽

Vol 55 (2) ◽

pp. 494-502 ◽

Author(s):

Kuo-Ching Ying

Keyword(s):

Single Machine ◽

Search Algorithm ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Scheduling Problems ◽

Beam Search ◽

Due Date ◽

Common Due Date ◽

Machine Scheduling Problems

Download Full-text

Optimal common due-date with limited completion time

Computers & Operations Research ◽

10.1016/0305-0548(91)90048-v ◽

1991 ◽

Vol 18 (1) ◽

pp. 125-127 ◽

Author(s):

Bernard Dickman ◽

Yonah Wilamowsky ◽

Sheldon Epstein

Keyword(s):

Completion Time ◽

Due Date ◽

Common Due Date

Download Full-text

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

Operations Research ◽

10.1287/opre.39.5.847 ◽

1991 ◽

Vol 39 (5) ◽

pp. 847-856 ◽

Author(s):

Nicholas G. Hall ◽

Wieslaw Kubiak ◽

Suresh P. Sethi

Keyword(s):

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Completion Times

Download Full-text

Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems

Robotics and Computer-Integrated Manufacturing ◽

10.1016/j.rcim.2004.12.005 ◽

2006 ◽

Vol 22 (4) ◽

pp. 279-287 ◽

Author(s):

Liu Min ◽

Wu Cheng

Keyword(s):

Genetic Algorithms ◽

Parallel Machine ◽

Optimal Scheduling ◽

Scheduling Problems ◽

Due Date ◽

Due Date Assignment ◽

Common Due Date ◽

Scheduling Policy

Download Full-text

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights

Journal of Combinatorial Optimization ◽

10.1007/s10878-019-00512-z ◽

2019 ◽

Vol 39 (3) ◽

pp. 764-775 ◽

Author(s):

Vincent T’kindt ◽

Lei Shang ◽

Federico Della Croce

Keyword(s):

Just In Time ◽

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Exponential Time ◽

Exponential Time Algorithms ◽

Time Scheduling

Download Full-text

Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

European Journal of Operational Research ◽

10.1016/s0377-2217(00)00170-3 ◽

2001 ◽

Vol 132 (3) ◽

pp. 643-665 ◽

Author(s):

K. Gowrishankar ◽

Chandrasekharan Rajendran ◽

G. Srinivasan

Keyword(s):

Completion Time ◽

Flow Shop ◽

Scheduling Algorithms ◽

Sum Of Squares ◽

Flow Shop Scheduling ◽

Due Date ◽

Common Due Date ◽

Shop Scheduling ◽

Download Full-text

Decomposition heuristics for parallel-machine multiple orders per job scheduling problems with a common due date

Journal of the Operational Research Society ◽

10.1080/01605682.2019.1640589 ◽

2019 ◽

pp. 1-17

Author(s):

Jens Rocholl ◽

Lars Mönch

Keyword(s):

Job Scheduling ◽

Parallel Machine ◽

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Multiple Orders

Download Full-text