A closed-form solution for the optimal release times for the F2| deteriorating jobs | w_jc_j problem
From MaRDI portal
Publication:2275945
DOI10.1016/J.DAM.2011.04.003zbMATH Open1218.90080OpenAlexW1596352210MaRDI QIDQ2275945FDOQ2275945
Authors: Edouard Wagneur, Daniel Ng, T. C. Edwin Cheng
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.003
Recommendations
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Minimizing the number of tardy job units under release time constraints
- Job release scheduling problem: complexity and an approximation algorithm
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- Minimizing total lateness with deteriorating jobs based on rescheduling problems
- Scheduling deteriorating jobs on a single machine with release times and rejection
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Minimizing the total weighted completion time of deteriorating jobs
- scientific article; zbMATH DE number 89399
deteriorating jobsweighted completion timesmultiple-machine deterministic sequencingoptimal release times
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Time-dependent scheduling
- Minimizing the total weighted completion time of deteriorating jobs
- Minimizing maximum lateness under linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Parametric problem in scheduling theory
- Scheduling jobs with position-dependent processing times
- Parallel machine scheduling with time dependent processing times
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Job sequencing with exponential functions of processing times
- Scheduling jobs in a contaminated area: a model and heuristic algorithms
- Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
- Scheduling jobs with varying processing times
- Scheduling deteriorating jobs to minimize makespan
- A variant of the permutation flow shop model with variable processing times
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
- The two-machine permutation flow shop with state-dependent processing times
- The Effect Of Queue Discipline On The Capacity Of Oueues With Service Time Dependent On Waiting Times
Cited In (3)
This page was built for publication: A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275945)