Pages that link to "Item:Q2638921"

The following pages link to Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem (Q2638921):

Displayed 50 items.

• 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)
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time (Q433105) ‎ (← links)
• Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) ‎ (← links)
• Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) ‎ (← 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)
• A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) ‎ (← links)
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) ‎ (← links)
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) ‎ (← links)
• Scheduling linearly shortening jobs under precedence constraints (Q552447) ‎ (← links)
• A single-machine scheduling problem with two-agent and deteriorating jobs (Q611543) ‎ (← links)
• Single-machine scheduling with deteriorating functions for job processing times (Q611703) ‎ (← 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)
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine (Q639173) ‎ (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) ‎ (← links)
• Scheduling with deteriorating jobs and learning effects (Q654684) ‎ (← links)
• Single-machine scheduling with a nonlinear deterioration function (Q656605) ‎ (← links)
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) ‎ (← 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)
• Preemptive scheduling with simple linear deterioration on a single machine (Q708208) ‎ (← links)
• Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) ‎ (← links)
• Preemptive repayment policy for multiple loans (Q763209) ‎ (← 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)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) ‎ (← links)
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) ‎ (← links)
• Sequence optimization and design of allocation using GA and SA (Q884646) ‎ (← links)
• Patients scheduling problems with deferred deteriorated functions (Q887895) ‎ (← 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)
• Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) ‎ (← links)
• Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times (Q968039) ‎ (← links)
• Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) ‎ (← links)
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) ‎ (← 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)
• Single machine scheduling with start time dependent processing times: Some solvable cases (Q1342026) ‎ (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) ‎ (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) ‎ (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) ‎ (← links)
• Due date single machine scheduling problems with nonlinear deterioration and learning effects and past sequence dependent setup times (Q1718923) ‎ (← links)
• A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) ‎ (← links)
• Research on scheduling problems with general effects of deterioration and learning (Q1749104) ‎ (← links)
• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs (Q1886856) ‎ (← links)
• Parallel machine scheduling with time dependent processing times (Q1923596) ‎ (← links)
• Single-machine scheduling with logarithm deterioration (Q1926617) ‎ (← links)