On index priority sequencing rules for scheduling with time-dependent job processing times

DOI10.1016/J.ORL.2013.05.006zbMATH Open1286.90059OpenAlexW2046604814MaRDI QIDQ2450686FDOQ2450686

Authors: George J. Kyparisis, C. Koulamas 

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.05.006

Recommendations

• Scheduling with time dependent processing times: Review and extensions
• Single machine scheduling problems with position-dependent processing times
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Single-machine scheduling problems with time and position dependent processing times
• Study on single machine scheduling problem based on general time-and-position dependent jobs processing time

zbMATH Keywords

sequencingvariable processing timesindex priority rules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• Minimizing the total weighted completion time of deteriorating jobs
• A state-of-the-art review on scheduling with learning effects
• Scheduling Deteriorating Jobs on a Single Processor
• A concise survey of scheduling with time-dependent processing times
• Scheduling with time dependent processing times: Review and extensions
• Scheduling jobs under simple linear deterioration
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
• A note on the optimality of index priority rules for search and sequencing problems

Cited In (6)

• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Minimizing total load on parallel machines with linear deterioration
• Valid inequalities for a time-indexed formulation
• Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
• Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
• A note on the optimality of index priority rules for search and sequencing problems

This page was built for publication: On index priority sequencing rules for scheduling with time-dependent job processing times

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