Pages that link to "Item:Q4230171"

The following pages link to Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171):

Displaying 29 items.

• A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• Scheduling problems in master-slave model (Q940888) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines (Q1295836) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
• Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers (Q1585811) (← links)
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
• A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation (Q1998264) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
• Integer programming approach to production scheduling for make-to-order manufacturing (Q2486790) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• Batch-size-based rearrangement of the shop floor into mini-lines (Q2967580) (← links)
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line (Q3055437) (← links)
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
• Steel-making process scheduling using Lagrangian relaxation (Q4443361) (← links)
• Bottleneck-focused scheduling for a hybrid flowshop (Q4474711) (← links)
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
• Solving the<i>n</i>-job 3-stage flexible flowshop scheduling problem using an agent-based approach (Q4823496) (← links)
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop (Q5466727) (← links)
• Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
• A flexible flowshop problem with total flow time minimization (Q5939584) (← links)