NP-hard cases in scheduling deteriorating jobs on dedicated machines
From MaRDI portal
Publication:4658457
DOI10.1057/palgrave.jors.2601117zbMath1181.90120OpenAlexW1972888404MaRDI QIDQ4658457
No author found.
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601117
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ A note on the complexity of flow-shop scheduling with deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Identical parallel machine scheduling with time-dependent processing times ⋮ Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption ⋮ Single machine group scheduling under decreasing linear deterioration ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION ⋮ Single-machine scheduling with deteriorating jobs ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Single-machine ready times scheduling with group technology and proportional linear deterioration ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Rescheduling problems with deteriorating jobs under disruptions ⋮ The Browne-Yechiali single-machine sequence is optimal for flow-shops ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs ⋮ Single machine parallel-batch scheduling with deteriorating jobs ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
