A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs

DOI10.1155/2015/340769zbMath1394.90291OpenAlexW1552241730WikidataQ59118058 ScholiaQ59118058MaRDI QIDQ1665390

Xiaoxi Zhu, Rui Zhang, Miaomiao Wang, Yueyue Liu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/340769

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• A concise survey of scheduling with time-dependent processing times
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Minimizing maximum lateness under linear deterioration

This page was built for publication: A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs