What is it about?

A single machine problem with release dates, deadlines and a start time dependent processing time function is considered. The objective is to find the Pareto-optimal set of schedules with respect to a non-decreasing function depending on the completion times of the jobs and the makespan.

Featured Image

Why is it important?

For the problem under consideration, a polynomial time algorithm is given.

Read the Original

This page is a summary of: On a generalized single machine scheduling problem with time-dependent processing times**Supported by RFBR grants 13-01-12108, 15-07-07489, 15-07-03141 and DAAD grant A/1400328, IFAC-PapersOnLine, January 2016, Elsevier,
DOI: 10.1016/j.ifacol.2016.07.603.
You can read the full text:

Read

Contributors

The following have contributed to this page