Volume 41, Number 2, April-June 2007ROADEF 05
|Page(s)||141 - 154|
|Published online||15 June 2007|
Scheduling with periodic availability constraints and irregular cost functions
CNRS-LIP6. 4, place Jussieu 75252 Paris Cedex 05, France; Francis.Sourd@lip6.fr
Accepted: 10 June 2006
This paper addresses a one-machine scheduling problem in which the efficiency of the machine is not constant, that is the duration of a task is longer in badly efficient time periods. Each task has an irregular completion cost. Under the assumption that the efficiency constraints are time-periodic, we show that the special case where the sequence is fixed can be solved in polynomial time. The general case is NP-complete so that we propose a two-phase heuristic to find good solutions. Our approach is tested on problems with earliness-tardiness costs.
Mathematics Subject Classification: 90B35
Key words: Scheduling / earliness-tardiness / availability / break
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.