Pages that link to "Item:Q621032"
From MaRDI portal
The following pages link to Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032):
Displaying 37 items.
- Single-machine scheduling with learning and forgetting effects (Q358103) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties (Q548379) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Single machine group scheduling with time dependent processing times and ready times (Q726558) (← links)
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Total completion time in a two-machine flowshop with deteriorating tasks (Q928678) (← links)
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q1791483) (← links)
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- The due date assignment scheduling problem with the deteriorating jobs and delivery time (Q2089176) (← links)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop (Q2241320) (← links)
- Single-machine scheduling problems with machine aging effect and an optional maintenance activity (Q2293744) (← 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)
- Single-machine scheduling with accelerating deterioration effects (Q2448137) (← links)
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- Tri-criteria single machine scheduling model with release times and learning factor (Q2660076) (← links)
- Minimizing makespan in permutation flow shop scheduling with proportional deterioration (Q2788531) (← links)
- A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129) (← links)
- Permutation flow shop problem with shortening job processing times (Q2821099) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
