A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
From MaRDI portal
(Redirected from Publication:628666)
Recommendations
- Two-machine flow shop scheduling problems with no-wait jobs
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Two-machine flowshop scheduling with availability constraints
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Two-machine flow-shop scheduling with deterioration and rejection
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Two-machine flow shop no-wait scheduling with machine maintenance
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Cites work
- A concise survey of scheduling with time-dependent processing times
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Encyclopedia of Optimization
- Handbook of applied optimization
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling jobs under simple linear deterioration
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- The NP-completeness column: An ongoing guide
- Time-dependent scheduling
Cited in
(18)- A survey of scheduling problems with no-wait in process
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- Single-machine scheduling problems with an actual time-dependent deterioration
- Scheduling jobs with truncated exponential learning functions
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates
- Two‐machine flowshop scheduling with conditional deteriorating second operations
- Flow shop scheduling problem with position-dependent processing times
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
- Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Single-machine scheduling with logarithm deterioration
- Stability of Johnson's schedule with respect to limited machine availability
- Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
This page was built for publication: A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628666)
