Heuristic approaches for n/m/F/ ∑Ci scheduling problems

No abstract is available for this paper.

• Publication year

  1997

• Venue

  European Journal of Operational Research

• Publication date

  1997-02-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1016/0377-2217(95)00347-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The permutation flow shop problem with sum‐of‐completion times performance criterion

  1993cited by this paper
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

  1990cited by this paper
• Lower bounds for single‐machine scheduling problems

  1990cited by this paper
• Openshop and flowshop scheduling to minimize sum of completion times

  1984cited by this paper
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results

  1980cited by this paper
• Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues

  1974cited by this paper

• Pixelation of time matrices for solving permutation flowshop scheduling problem

  2024cites this paper
• Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing

  2024cites this paper
• Scheduling in Industrial environment toward future: insights from Jean-Marie Proth

  2023cites this paper
• Simultaneously Updating Multiple Performance Measures of Manufacturing Systems after Scheduling Perturbations

  2022cites this paper
• An efficiency and robustness analysis of warm-start mathematical models for idle and waiting times optimization in the flow shop

  2022cites this paper
• Reentrant flow shop with identical jobs and makespan criterion

  2021cites this paper
• A data mining-based solution method for (cid:13)ow shop scheduling problems

  2021cites this paper
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling

  2020cites this paper
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems

  2019cites this paper
• Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching

  2018cites this paper
• A Data Mining Based Solution Method for Flow Shop Scheduling Problems

  2017cites this paper
• Fuzzy greedy search heuristic for combinatorial optimization with specific application to machine scheduling

  2017cites this paper
• Hybrid Flow-Shop Scheduling Problem Based on Genetic Algorithm

  2017cites this paper
• A Two-Phase Constructive Heuristic for Permutation Flow-Shop Scheduling Problem Minimizing Total Completion Time

  2016cites this paper
• A Hybrid Differential Evolution Algorithm Based on Dynamic Variable Neighborhood Search for Permutation Flowshop Scheduling Problem

  2016cites this paper
• A Discrete Inter-Species Cuckoo Search for flowshop scheduling problems

  2015cites this paper
• The m-Machine Flow Shop

  2013cites this paper
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

  2013influential citation
• Improved Flow Shop Schedules with Total Completion Time Criterion

  2013cites this paper
• An improved differential evolution for permutation flowshop scheduling problem with total flowtime criterion

  2012cites this paper
• Minimizing total flow time in permutation flowshop environment

  2012cites this paper
• An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization

  2011cites this paper
• An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion

  2010cites this paper
• Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

  2010cites this paper
• A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem

  2010cites this paper
• UM ALGORITMO HÍBRIDO PARA UM PROBLEMA DE PROGRAMAÇÃO DA PRODUÇÃO POR FLUXO PERMUTACIONAL

  2010cites this paper
• Solving the flow shop problem by parallel programming

  2009cites this paper
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

  2009cites this paper
• Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling

  2009cites this paper
• Równoległy algorytm hybrydowy dla problemu przepływowego z kryterium Csum

  2009cites this paper
• Efficient composite heuristics for total flowtime minimization in permutation flow shops

  2009cites this paper
• A Multi-Objective Ant-Colony Algorithm for Permutation Flowshop Scheduling to Minimize the Makespan and Total Flowtime of Jobs

  2009cites this paper
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

  2009cites this paper
• Parallel Path-Relinking Method for the Flow Shop Scheduling Problem

  2008cites this paper
• A bicriteria flowshop scheduling with a learning effect

  2008cites this paper
• A combinatorial particle swarm optimisation for solving permutation flowshop problems

  2008cites this paper
• Parallel tabu search algorithm for the permutation flow shop problem with criterion of minimizing sum of job completion times

  2008cites this paper
• Reducing mean flow time in permutation flow shop

  2008cites this paper
• A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times

  2008cites this paper
• An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling

  2008cites this paper
• Landscapes, Embedded Paths and Evolutionary Scheduling

  2007cites this paper
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

  2007cites this paper
• Parallel Scatter Search Algorithm for the Flow Shop Sequencing Problem

  2007cites this paper
• Metody dywersyfikacji procesu przeszukiwań algorytmów popraw dla problemu przepływowego z kryterium sumacyjnym

  2007cites this paper
• Równoległy algorytm scatter search dla problemu przepływowego z kryterium Csum

  2007cites this paper
• Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop

  2007cites this paper
• A discrete differential evolution algorithm for the permutation flowshop scheduling problem

  2007cites this paper
• Heuristic-Tabu-Genetic Algorithm Based Method for Flowshop Scheduling to Minimize Flowtime

  2006cites this paper
• A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs

  2006cites this paper
• Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization

  2006cites this paper
• Heuristics forpermutation flowshops tominimize total flowtime

  2006cites this paper
• Minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers

  2006cites this paper
• An Efficient Heuristic for Scheduling a Flowshop to Minimize the Makespan Criterion

  2006cites this paper
• A Composite Algorithm for Total Completion-Time Minimization in Large Flow Shop Scheduling

  2006cites this paper
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan

  2006cites this paper
• Metaheurística Híbrida Algoritmo Genético-Clustering Search Para A Otimização Em Sistemas De Produção Flow Shop Permutacional

  2006cites this paper
• Heuristics for permutation flow shops to minimize total flowtime

  2006cites this paper
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

  2005cites this paper
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

  2005cites this paper
• REDUÇÃO DO ESTOQUE EM PROCESSAMENTO EM SISTEMAS DE PRODUÇÃO FLOW SHOP PERMUTACIONAL REDUCING IN-PROCESS INVENTORY IN PERMUTATION FLOW SHOP PRODUCTION ENVIRONMENT

  2005cites this paper
• Comparison of heuristics for flowtime minimisation in permutation flowshops

  2005cites this paper
• A fast flowtime-computing procedure and its applications to heuristics for flow shops with flowtime minimization

  2004cites this paper
• Programação da produção flow shop permutacional com minimização do tempo médio de fluxo

  2004cites this paper
• The New Concepts in Parallel Simulated Annealing Method

  2004cites this paper
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

  2004cites this paper
• Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003

  2004cites this paper
• Parallel Genetic Algorithm for the Flow Shop Scheduling Problem

  2003cites this paper
• The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

  2003cites this paper
• An efficient constructive heuristic for flowtime minimisation in permutation flow shops

  2003cites this paper
• New heuristics to minimize total completion time in m-machine flowshops

  2002cites this paper
• The Tricriteria Two-Machine Flowshop Scheduling Problem

  2001cites this paper
• Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem

  2001cites this paper
• Simulation in production scheduling: scheduling flow-shops with limited buffer spaces

  2000cites this paper
• Scheduling flow-shops with limited buffer spaces

  2000cites this paper
• Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search

  1998cites this paper