Pages that link to "Item:Q3815121"

The following pages link to On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem (Q3815121):

Displaying 26 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• A global MILP model for FMS scheduling (Q1278123) (← links)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
• Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
• Two models for a family of flowshop sequencing problems (Q1848365) (← links)
• Flow-shop scheduling with flexible processors (Q1891241) (← links)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
• Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
• A study of integer programming formulations for scheduling problems (Q3124684) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
• Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
• Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)