Pages that link to "Item:Q1410319"
From MaRDI portal
The following pages link to A concise survey of scheduling with time-dependent processing times (Q1410319):
Displaying 50 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Scheduling a deteriorating maintenance activity and due-window assignment (Q337476) (← links)
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← 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)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← 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)
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) (← links)
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities (Q497936) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times (Q513627) (← links)
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects (Q534943) (← links)
- Single-machine total completion time scheduling with a time-dependent deterioration (Q534948) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties (Q548379) (← links)
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
- A single-machine scheduling problem with two-agent and deteriorating jobs (Q611543) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- Single-machine scheduling with deteriorating functions for job processing times (Q611703) (← links)
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← links)
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
