The following pages link to Time-dependent scheduling (Q938826):
Displayed 50 items.
- A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
- Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects (Q2215199) (← links)
- New results for an open time-dependent scheduling problem (Q2215202) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
- Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem (Q2275945) (← links)
- Scheduling jobs with position and sum-of-processing-time based processing times (Q2278782) (← links)
- Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q2282925) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- A branch and bound algorithm for agile earth observation satellite scheduling (Q2314755) (← links)
- Bicriterion scheduling with group technology and deterioration effect (Q2318322) (← links)
- An uncertain parallel machine problem with deterioration and learning effect (Q2322326) (← links)
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection (Q2331597) (← links)
- Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
- Scheduling problems with effects of deterioration and truncated job-dependent learning (Q2354204) (← links)
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) (← links)
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs (Q2399611) (← links)
- Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
- Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
- Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time (Q2439496) (← links)
- Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (Q2439528) (← links)
- Parallel machines scheduling with deteriorating and learning effects (Q2448133) (← links)
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
- Single-machine scheduling with accelerating deterioration effects (Q2448137) (← links)
- Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
- Single machine group scheduling with time and position dependent processing times (Q2448214) (← links)
- The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
- Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs (Q2628180) (← links)
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects (Q2628200) (← links)
- Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times (Q2788530) (← links)
- Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (Q2788531) (← links)
- Permutation Flow Shop Problem with Shortening Job Processing Times (Q2821099) (← links)
- A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING" (Q2875625) (← links)
- SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS (Q2920364) (← links)
- Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
- Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration (Q2958667) (← links)
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)