Pages that link to "Item:Q1001006"

The following pages link to Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006):

Displaying 26 items.

• Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
• Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
• A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem (Q473807) (← links)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← 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)
• Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
• Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
• Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
• Single machine scheduling with sum-of-logarithm-processing-times based deterioration (Q726391) (← links)
• Single machine group scheduling with time dependent processing times and ready times (Q726558) (← links)
• Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines (Q828672) (← links)
• Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
• Single-machine scheduling problems with an actual time-dependent deterioration (Q1667852) (← links)
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times (Q1788956) (← links)
• Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
• Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2379563) (← links)
• Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
• Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
• Permutation Flow Shop Problem with Shortening Job Processing Times (Q2821099) (← links)
• MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (Q2873830) (← links)
• Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
• Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology (Q5059395) (← links)