A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
From MaRDI portal
Publication:3013563
DOI10.1142/S0217595911003272zbMath1217.90115MaRDI QIDQ3013563
No author found.
Publication date: 18 July 2011
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (8)
Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan ⋮ A branch and price algorithm for single-machine completion time variance ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS ⋮ A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING"
Cites Work
- The complexity of scheduling starting time dependent tasks with release times
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Scheduling jobs under decreasing linear deterioration
- Mimimization of agreeably weighted variance in single machine systems
- Proof of a conjecture of Schrage about the completion time variance problem
- A tight lower bound for the completion time variance problem
- Completion time variance minimization on a single machine is difficult
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- A branch and bound algorithm to minimize completion time variance on a single processor.
- Minimizing completion time variance with compressible processing times
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- A note on single-processor scheduling with time-dependent execution times
- Single machine group scheduling under decreasing linear deterioration
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Minimizing Variation of Flow Time in Single Machine Systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
- Scheduling jobs with piecewise linear decreasing processing times
- Scheduling start time dependent jobs to minimize the total weighted completion time
- A note on scheduling problems with learning effect and deteriorating jobs
- Variance Minimization in Single Machine Sequencing Problems
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
