A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

Optimization Letters ◽

10.1007/s11590-011-0330-2 ◽

2011 ◽

Vol 6 (5) ◽

pp. 1021-1025 ◽

Author(s):

Radosław Rudek

Keyword(s):

Time Dependent ◽

Scheduling Problems ◽

Processing Times ◽

Download Full-text

Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times

Operations Research Proceedings 2002 ◽

10.1007/978-3-642-55537-4_34 ◽

2003 ◽

pp. 211-216 ◽

Author(s):

Aleksander Bachman ◽

Adam Janiak ◽

Mikhail Y. Kovalyov

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Time Dependent ◽

Scheduling Problems ◽

Processing Times ◽

Machine Scheduling Problems

Download Full-text

Single-machine scheduling problems with start-time dependent processing time

Computers & Mathematics with Applications ◽

10.1016/j.camwa.2006.07.012 ◽

2007 ◽

Vol 53 (11) ◽

pp. 1658-1664 ◽

Author(s):

Wen-Hung Kuo ◽

Dar-Li Yang

Keyword(s):

Single Machine ◽

Processing Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Time Dependent ◽

Scheduling Problems ◽

Machine Scheduling Problems

Download Full-text

Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration

Applied Mathematics and Computation ◽

10.1016/j.amc.2010.08.064 ◽

2010 ◽

Vol 217 (7) ◽

pp. 3321-3329 ◽

Author(s):

Suh-Jenq Yang

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Time Dependent ◽

Scheduling Problems ◽

Aging Effects ◽

Deteriorating Maintenance ◽

Dependent Learning ◽

Machine Scheduling Problems

Download Full-text

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

International Transactions in Operational Research ◽

10.1111/j.1475-3995.2005.501_1.x ◽

2005 ◽

Vol 12 (3) ◽

pp. 355-366 ◽

Author(s):

T. C. E. Cheng ◽

L. Y. Kang ◽

C. T. Ng

Keyword(s):

Single Machine ◽

Time Dependent ◽

Due Date ◽

Processing Times

Download Full-text

Single machine scheduling with start time dependent processing times: Some solvable cases

European Journal of Operational Research ◽

10.1016/0377-2217(94)90048-5 ◽

1994 ◽

Vol 78 (3) ◽

pp. 394-403 ◽

Author(s):

P.S. Sundararaghavan ◽

A.S. Kunnathur

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Time Dependent ◽

Processing Times

Download Full-text

Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-009-2089-5 ◽

2009 ◽

Vol 46 (1-4) ◽

pp. 291-299 ◽

Author(s):

Wen-Jun Gao ◽

Xue Huang ◽

Ji-Bo Wang

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Precedence Constraints ◽

Time Dependent ◽

Processing Times

Download Full-text

Minimizing cycle time in single machine scheduling with start time-dependent processing times

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-012-4116-1 ◽

2012 ◽

Vol 64 (9-12) ◽

pp. 1479-1486 ◽

Author(s):

Mehdi Hosseinabadi Farahani ◽

Leila Hosseini

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Time Dependent ◽

Processing Times

Download Full-text

Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Computers & Operations Research ◽

10.1016/s0305-0548(01)00077-6 ◽

2003 ◽

Vol 30 (1) ◽

pp. 51-62 ◽

Author(s):

T.C.E. Cheng ◽

Q. Ding

Keyword(s):

Single Machine ◽

Time Dependent ◽

Processing Times ◽

Initial Processing ◽

Dependent Tasks

Download Full-text

Task assignment with start time-dependent processing times for personnel at check-in counters

Journal of Scheduling ◽

10.1007/s10951-017-0523-3 ◽

2017 ◽

Vol 21 (1) ◽

pp. 93-109 ◽

Author(s):

Emilio Zamorano ◽

Annika Becker ◽

Raik Stolletz

Keyword(s):

Task Assignment ◽

Time Dependent ◽

Processing Times

Download Full-text

Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Mathematical Problems in Engineering ◽

10.1155/2013/972358 ◽

2013 ◽

Vol 2013 ◽

pp. 1-9 ◽

Author(s):

Jianbo Qian ◽

George Steiner

Keyword(s):

Single Machine ◽

Single Machine Scheduling ◽

Time Dependent ◽

Scheduling Problems ◽

Processing Times ◽

Number Of Tardy Jobs ◽

Special Cases ◽

Programming Techniques ◽

Weighted Number ◽

We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them inO(n4) time. For some important special cases, the time complexity can be improved to beO(n2) using dynamic programming techniques.

Download Full-text