Pages that link to "Item:Q4658457"
From MaRDI portal
The following pages link to NP-hard cases in scheduling deteriorating jobs on dedicated machines (Q4658457):
Displaying 41 items.
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
- A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Rescheduling problems with deteriorating jobs under disruptions (Q967797) (← links)
- The Browne-Yechiali single-machine sequence is optimal for flow-shops (Q976013) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
- Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
- Single-machine ready times scheduling with group technology and proportional linear deterioration (Q1991336) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Multi-objective open shop scheduling by considering human error and preventive maintenance (Q2307240) (← links)
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval (Q2346517) (← links)
- A note on the complexity of scheduling problems with linear job deterioration (Q2349528) (← links)
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
- Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
- Minimizing makespan in permutation flow shop scheduling with proportional deterioration (Q2788531) (← links)
- Permutation flow shop problem with shortening job processing times (Q2821099) (← links)
- Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
- SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION (Q3013566) (← links)
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
- Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
- Scheduling deteriorating jobs to minimize makespan (Q4248925) (← links)
- Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
- Single Machine Two-Agent Scheduling with Deteriorating Jobs (Q5506754) (← links)
- Scheduling dedicated jobs with variative processing times (Q5963650) (← links)