Single-machine scheduling with time window-dependent processing times

DOI10.1057/palgrave.jors.2601931zbMath1090.90086OpenAlexW2009046829MaRDI QIDQ5200784

Stéphane Dauzère-Pérès, C. Lahlou

Publication date: 11 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601931

zbMATH Keywords

computational complexityschedulingtime windowstime-dependent processing timeone-machine

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine ⋮ A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times

This page was built for publication: Single-machine scheduling with time window-dependent processing times