Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
From MaRDI portal
Publication:2467255
DOI10.1016/J.EJOR.2006.03.067zbMATH Open1138.90396OpenAlexW1998853417MaRDI QIDQ2467255FDOQ2467255
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1265
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
Cited In (24)
- A Two-Stage Flexible Flowshop Problem with Deterioration
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Minimizing the total waiting time of intermediate products in a manufacturing process
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- A note on single-machine scheduling with decreasing time-dependent job processing times
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Modeling the parallel machine scheduling problem with step deteriorating jobs
- Single-machine scheduling with nonlinear deterioration
- Minimizing total completion time on a batching machine with job processing time compatibilities
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
- A survey of scheduling problems with setup times or costs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
- Title not available (Why is that?)
- Minimizing the Range of Order Completion Times with Multiple Job Classes
- Batch scheduling with deteriorating jobs to minimize the total completion time
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
Recommendations
- Batch scheduling of step deteriorating jobs π π
- Batch scheduling with deteriorating jobs to minimize the total completion time π π
- Batch Scheduling of Deteriorating Products π π
- Single-machine batch scheduling of linear deteriorating jobs π π
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan π π
This page was built for publication: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467255)