Pages that link to "Item:Q2467249"

The following pages link to A survey of scheduling problems with setup times or costs (Q2467249):

Displaying 50 items.

• Parallel machines scheduling with machine preference via agent-based approach (Q272606) (← links)
• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• Optimal single machine scheduling of products with components and changeover cost (Q297186) (← links)
• Scheduling with few changes (Q299829) (← links)
• Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Batching scheduling in a two-level supply chain with earliness and tardiness penalties (Q328087) (← links)
• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
• An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← links)
• Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) (← links)
• The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
• Lot scheduling on a single machine (Q402382) (← links)
• Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
• Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
• Control methods for dynamic time-based manufacturing under customized product lead times (Q439459) (← links)
• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
• Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
• Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs (Q552454) (← links)
• Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption (Q552458) (← links)
• On-line machine scheduling with batch setups (Q604758) (← links)
• Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
• Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469) (← links)
• Scheduling with multiple servers (Q612219) (← links)
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• A mathematical model for the management of a service center (Q636490) (← links)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
• Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
• Integrated production and distribution planning in the fast moving consumer goods industry: A block planning application (Q708871) (← links)
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
• A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times (Q709158) (← links)