Pages that link to "Item:Q1652070"

The following pages link to New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070):

Displaying 18 items.

• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
• Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
• Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
• Tailoring customer order scheduling search algorithms (Q2003430) (← links)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
• Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
• A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities (Q2222085) (← links)
• A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
• Spatial and temporal optimization for smart warehouses with fast turnover (Q2664446) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
• An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems (Q6168349) (← links)
• Solving customer order scheduling problems with an iterated greedy algorithm (Q6606519) (← links)
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)