Pages that link to "Item:Q1260741"

The following pages link to A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741):

Displaying 38 items.

• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
• An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan (Q1010280) (← links)
• Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
• Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
• A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
• Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116) (← links)
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness (Q1793450) (← links)
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (Q1819236) (← links)
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
• Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
• A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop (Q2004254) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
• Note on minimizing total tardiness in a two-machine flowshop (Q2387308) (← links)
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
• (Q2951947) (← links)
• Minimizing the total flow time and the tardiness in a two-machine flow shop (Q3153828) (← links)
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717) (← links)
• Two-machine flowshop scheduling to minimize total tardiness (Q4352599) (← links)
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness (Q5289353) (← links)
• Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)
• Algorithms for a two‐machine flowshop problem with jobs of two classes (Q6090515) (← links)
• Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing (Q6151475) (← links)