Pages that link to "Item:Q2834736"

The following pages link to Optimal two- and three-stage production schedules with setup times included (Q2834736):

Displaying 50 items.

• An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
• Flow shop non-idle scheduling and resource-constrained scheduling (Q271983) (← links)
• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
• New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
• Relocation scheduling subject to fixed processing sequences (Q282245) (← links)
• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Job-shop production scheduling with reverse flows (Q319298) (← links)
• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
• Two-agent scheduling in a flowshop (Q322895) (← links)
• An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
• A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA (Q337333) (← links)
• On double cycling for container port productivity improvement (Q338901) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
• A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← 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)
• Improving the anytime behavior of two-phase local search (Q408982) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
• Dominance rules in combinatorial optimization problems (Q421551) (← links)
• Routing open shop and flow shop scheduling problems (Q421573) (← links)
• Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem (Q473807) (← links)
• Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← links)
• A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
• Hybrid flowshop scheduling with interstage job transportation (Q489104) (← links)
• On two-machine flow shop scheduling (Q489134) (← links)
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)