Single machine scheduling problems with exponentially start time dependent job processing times

MaRDI QIDQ5301734zbMATH OpenFDO

Authors Aleksander Bachman, Adam Janiak, M. Y. Kovalyov

Publication date 20 January 2009

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job sequencing with exponential functions of processing times
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Single-machine scheduling problems with start-time dependent processing time
• scientific article; zbMATH DE number 1264428
• Single-machine scheduling with time window-dependent processing times

Cited in

(9)

• scientific article; zbMATH DE number 5732213 (Why is no real title available?)
• Single-machine scheduling problems with start-time dependent processing time
• scientific article; zbMATH DE number 5031195 (Why is no real title available?)
• The complexity of scheduling starting time dependent tasks with release times
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
• Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
• Job sequencing with exponential functions of processing times
• Single machine group scheduling with time and position dependent processing times

This page was built for publication: Single machine scheduling problems with exponentially start time dependent job processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301734)