A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem

DOI10.1016/j.ejor.2003.08.030zbMath1065.90036OpenAlexW1986887124MaRDI QIDQ1887766

Alain Guinet, Mohamed Moalla, Nour El Houda Saadani

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.030

zbMATH Keywords

SchedulingTravelling salesman problemPermutation flow-shopNearest insertion ruleNo-idle machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (14)

A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ A branch-and-bound approach to the no-idle flowshop scheduling problem ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Permutation, no-wait, no-idle flow shop problems ⋮ The flow shop problem with no-idle constraints: a review and approximation ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• A new heuristic for the traveling salesman problem
• Paths, Trees, and Flowers
• An Algorithm for the Traveling Salesman Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• NP-hardness of compact scheduling in simplified open and flow shops.

This page was built for publication: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem