Pages that link to "Item:Q3483073"

The following pages link to Scheduling Deteriorating Jobs on a Single Processor (Q3483073):

Displaying 50 items.

• The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← 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)
• Single machine problem with multi-rate-modifying activities under a time-dependent deterioration (Q364253) (← 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)
• 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)
• New results on single-machine scheduling with past-sequence-dependent delivery times (Q441858) (← links)
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
• Single-machine scheduling with past-sequence-dependent delivery times and release times (Q456143) (← links)
• Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← 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)
• Minimizing the makespan for scheduling problems with general deterioration effects (Q460302) (← 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)
• 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)
• Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← 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)
• 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)
• Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← 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)
• 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)
• Scheduling problems with general effects of deterioration and learning (Q632713) (← 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)
• 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 on a single processor with variable speed (Q673343) (← 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)