Some single-machine and flowshop scheduling problems with a non-linear deterioration function

DOI10.1016/J.CAMWA.2011.07.037MaRDI QIDQ660909zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 5 February 2012

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2011.07.037

zbMATH Keywords

schedulingsingle-machinedeteriorating jobsflowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Single-machine scheduling with a nonlinear deterioration function
• Single-machine scheduling with nonlinear deterioration
• scientific article; zbMATH DE number 5732213
• Single-machine scheduling with deteriorating functions for job processing times
• Single-machine scheduling with deteriorating jobs

Cites work

• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• A due-date assignment problem with learning effect and deteriorating jobs
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• A note on single-processor scheduling with time-dependent execution times
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Learning effect and deteriorating jobs in the single machine scheduling problems
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
• Scheduling with time dependent processing times: Review and extensions
• Single machine multiple common due dates scheduling with learning effects
• Single machine scheduling problems with deteriorating jobs
• Single machine scheduling with decreasing linear deterioration under precedence constraints
• Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Single machine scheduling with step-deteriorating processing times
• Single-machine group scheduling problems with deterioration consideration
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Some single-machine scheduling problems with general effects of learning and deterioration
• The complexity of scheduling starting time dependent tasks with release times

Cited in

(9)

• Single-machine scheduling with a nonlinear deterioration function
• Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times
• Single-machine scheduling with accelerating deterioration effects
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
• Single-machine group scheduling problems with deterioration to minimize the sum of completion times
• Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time

This page was built for publication: Some single-machine and flowshop scheduling problems with a non-linear deterioration function

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