Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices

DOI10.1007/S10288-019-00410-4zbMATH Open1442.90068OpenAlexW2955229224WikidataQ127610466 ScholiaQ127610466MaRDI QIDQ2190797FDOQ2190797

Authors: Rubing Chen, Jinjiang Yuan 

Publication date: 22 June 2020

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-019-00410-4

Recommendations

• Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
• Single-machine batch scheduling of linear deteriorating jobs
• Single-machine due-window assignment and scheduling with linear deteriorating jobs and deteriorating maintenance
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
• Single-machine scheduling with deteriorating jobs
• Scheduling of single machine with deteriorating jobs and due-date assignment
• Single-machine scheduling with positional due indices and positional deadlines
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Single machine scheduling problems with deteriorating jobs
• Single machine scheduling with decreasing linear deterioration under precedence constraints

zbMATH Keywords

NP-harddeteriorating jobspolynomial-time algorithmssingle-machine schedulingdue indices

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Title not available (Why is that?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Isomorphic scheduling problems
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• Multiagent scheduling. Models and algorithms
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Time-dependent scheduling
• Scheduling linear deteriorating jobs with rejection on a single machine
• Lawler's minmax cost algorithm: optimality conditions and uncertainty
• Single machine parallel-batch scheduling with deteriorating jobs
• Equivalent time-dependent scheduling problems
• Parametric problem in scheduling theory
• Scheduling jobs under simple linear deterioration
• Rescheduling with new orders and general maximum allowable time disruptions
• Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs
• Two-agent single-machine scheduling problems under increasing linear deterioration
• Pareto minimizing total completion time and maximum cost with positional due indices
• Preemptive scheduling with simple linear deterioration on a single machine
• Title not available (Why is that?)
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• Scheduling with time-changing effects and rate-modifying activities
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Conjugate problems in time-dependent scheduling
• Title not available (Why is that?)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
• Coordination mechanisms for scheduling games with proportional deterioration
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
• Complexity of scheduling with proportional deterioration and release dates
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Lawler's minmax cost problem under uncertainty

Cited In (6)

• Single-machine online scheduling of jobs with non-delayed processing constraint
• A note on competing-agent Pareto-scheduling
• Single-machine scheduling with positional due indices and positional deadlines
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
• Online NDP-constraint scheduling of jobs with delivery times or weights
• Single-machine scheduling to minimize total weighted late work with positional due-indices

This page was built for publication: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices

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