Single-machine scheduling with time window-dependent processing times
From MaRDI portal
Publication:5200784
DOI10.1057/PALGRAVE.JORS.2601931zbMATH Open1090.90086OpenAlexW2009046829MaRDI QIDQ5200784FDOQ5200784
Authors: Chams Lahlou, Stèphane Dauzère-Pérès 
Publication date: 11 April 2006
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601931
Recommendations
- Scheduling with time dependent processing times: Review and extensions
- scientific article; zbMATH DE number 5031195
- Single-machine scheduling problems with start-time dependent processing time
- A concise survey of scheduling with time-dependent processing times
- Scheduling start time dependent jobs to minimize the total weighted completion time
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (10)
- Scheduling with time dependent processing times: Review and extensions
- Single-machine scheduling problems with start-time dependent processing time
- Title not available (Why is that?)
- Scheduling jobs with a V-shaped time-dependent processing time
- Single machine scheduling problems with exponentially start time dependent job processing times
- Title not available (Why is that?)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- A concise survey of scheduling with time-dependent processing times
- Title not available (Why is that?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200784)
