✦ LIBER ✦

A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

✍ Scribed by Radosław Rudek

Book ID: 120885469
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 116 KB
Volume: 7
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-012-0445-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on proving the strong NP-hardness

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

✍ Radosław Rudek 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 116 KB

A note on single-machine scheduling with

A note on single-machine scheduling with decreasing time-dependent job processing times

✍ Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

The strong NP-hardness of the maximum la

The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect

✍ Radosław Rudek 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Scheduling with a position-weighted lear

Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position

✍ Cheng, T.C.E.; Kuo, Wen-Hung; Yang, Dar-Li 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A note on “Single-machine scheduling pro

A note on “Single-machine scheduling problems with release time of jobs depending on resource allocated”

✍ Yu-Bin Wu, Zheng-Yi Piao, Huan Liu, Ping Ji 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 215 KB

A generalized two-machine flowshop sched

A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

✍ Dar-Li Yang; Maw-Sheng Chern 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider a two-machine ¯owshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0±1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computation