Pages that link to "Item:Q4656674"

The following pages link to Scheduling start time dependent jobs to minimize the total weighted completion time (Q4656674):

Displaying 50 items.

• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← 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)
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
• Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
• A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← 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)
• 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)
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
• Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
• Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
• A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802) (← links)
• Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
• Conjugate problems in time-dependent scheduling (Q1041348) (← links)
• Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
• One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times (Q1291626) (← 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)
• Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
• A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs (Q1665390) (← links)
• Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
• On scheduling with non-increasing time slot cost to minimize total weighted completion time (Q1702736) (← links)
• Single machine scheduling problems with deteriorating jobs (Q1764739) (← links)
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
• New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845) (← links)
• Single-machine scheduling with both deterioration and learning effects (Q2267309) (← links)
• The learning effect: getting to the core of the problem (Q2379968) (← links)
• Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
• Single machine group scheduling with time and position dependent processing times (Q2448214) (← links)
• Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
• Single-machine group scheduling problems with deterioration consideration (Q2459398) (← links)
• Two scheduling problems in group technology with deteriorating jobs (Q2483767) (← links)
• The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← 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)
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
• Single machine due-date scheduling of jobs with decreasing start-time dependent processing times (Q3025050) (← links)
• Scheduling manufacturing systems with blocking: a Petri net approach (Q3055253) (← links)
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING (Q3439889) (← links)
• Scheduling tasks with sequence-dependent processing times (Q3786260) (← links)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
• Single-machine scheduling with time window-dependent processing times (Q5200784) (← links)
• Partial dominated schedules and minimizing the total completion time of deteriorating jobs (Q5746677) (← links)