Pages that link to "Item:Q733523"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523):
Displayed 30 items.
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) (← links)
- A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem (Q473807) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Single-machine total completion time scheduling with a time-dependent deterioration (Q534948) (← links)
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
- Single-machine scheduling with deteriorating functions for job processing times (Q611703) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning (Q1667775) (← links)
- The study of group scheduling problems with general dual-position-based job processing times (Q1689067) (← links)
- Single-machine makespan minimization scheduling with nonlinear shortening processing times (Q1762019) (← links)
- Single-machine scheduling with logarithm deterioration (Q1926617) (← links)
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop (Q2241320) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
- Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (Q2788531) (← links)
- Permutation Flow Shop Problem with Shortening Job Processing Times (Q2821099) (← links)
- MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (Q2873830) (← links)
- SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS (Q2920364) (← links)
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)