Heuristics for a flowshop scheduling problem with stepwise job objective function
type: Item
instance of: scholarly article
title: Heuristics for a flowshop scheduling problem with stepwise job objective function
zbMATH Open document ID: 1403.90359
author: Luciana S. Pessoa
author: Carlos E. Andrade
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6876602
zbMATH Keywords: flowshop scheduling
zbMATH Keywords: heuristics
zbMATH Keywords: metaheuristics
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.10.045
OpenAlex ID: W2765562535
cites work: A hybrid primal heuristic for finding feasible solutions to mixed integer programs
cites work: Q4322338
cites work: Q4826104
cites work: A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
cites work: A $k$-Sample Model in Order Statistics
cites work: Minimizing tardy jobs in a flowshop with common due date
cites work: Scheduling jobs on parallel machines to minimize a regular step total cost function
cites work: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
cites work: A genetic algorithm for the weight setting problem in OSPF routing
cites work: Iterated greedy local search methods for unrelated parallel machine scheduling
cites work: Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: Handbook of metaheuristics
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Flowshop scheduling research after five decades
cites work: Variable Neighborhood Search
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
cites work: Q4452900
cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
cites work: Scheduling
cites work: Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
cites work: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
cites work: A genetic algorithm for flowshop sequencing
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
cites work: Single machine scheduling with delivery dates and cumulative payoffs
cites work: Performance guarantees for a scheduling problem with common stepwise job payoffs
cites work: Q5191184
cites work: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
cites work: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
DOI: 10.1016/J.EJOR.2017.10.045
description: scientific article; zbMATH DE number 6876602