The following pages link to Time-dependent scheduling (Q938826):
Displayed 50 items.
- Single-machine bicriterion group scheduling with deteriorating setup times and job processing times (Q279548) (← links)
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
- Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect (Q440896) (← links)
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine (Q458380) (← 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)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← 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)
- 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-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects'' (Q545340) (← 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)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← 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)
- 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)
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities (Q623150) (← links)
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
- A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368) (← links)
- Scheduling problems with general effects of deterioration and learning (Q632713) (← links)
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties (Q638880) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← links)
- Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine (Q639173) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
- Single-machine scheduling with a nonlinear deterioration function (Q656605) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)