Minimizing the makespan for the flow shop scheduling problem with availability constraints.

DOI10.1016/S0377-2217(03)00261-3zbMath1099.90536MaRDI QIDQ1420378

Riad Aggoune

Publication date: 2 February 2004

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

zbMATH Keywords

Genetic algorithmTabu searchSchedulingAvailability constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (18)

Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study ⋮ Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ An approach for integrated scheduling and lot-sizing ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Scheduling Resources for Throughput Maximization ⋮ Production, maintenance and resource scheduling: a review

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-machine flowshop scheduling with availability constraints
• A genetic algorithm for flowshop sequencing
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Future paths for integer programming and links to artificial intelligence
• Scheduling with limited machine availability
• A user's guide to tabu search
• Machine scheduling with an availability constraint
• Scheduling jobs and maintenance activities on parallel machines
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Two-machine flow shops with limited machine availability

This page was built for publication: Minimizing the makespan for the flow shop scheduling problem with availability constraints.