Pages that link to "Item:Q1332800"
From MaRDI portal
The following pages link to Scheduling jobs under simple linear deterioration (Q1332800):
Displayed 50 items.
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
- Patient scheduling with periodic deteriorating maintenance on single medical device (Q342021) (← 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)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
- Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← 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)
- Minimizing the makespan for scheduling problems with general deterioration effects (Q460302) (← links)
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← 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)
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
- Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- Scheduling with deteriorating jobs and learning effects (Q654684) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) (← links)
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
- Scheduling deteriorating jobs subject to job or machine availability constraints (Q869201) (← links)
- Patients scheduling problems with deferred deteriorated functions (Q887895) (← links)
- Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
- Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration (Q950056) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
- Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine (Q1014400) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)