Heuristics for a flowshop scheduling problem with stepwise job objective function
From MaRDI portal
Publication:1754167
DOI10.1016/j.ejor.2017.10.045zbMath1403.90359OpenAlexW2765562535MaRDI QIDQ1754167
Carlos E. Andrade, Luciana S. Pessoa
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.045
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar ⋮ The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications ⋮ A biased random-key genetic algorithm for the set orienteering problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
- A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Performance guarantees for a scheduling problem with common stepwise job payoffs
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- A genetic algorithm for flowshop sequencing
- A genetic algorithm for the weight setting problem in OSPF routing
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- Minimizing tardy jobs in a flowshop with common due date
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Single machine scheduling with delivery dates and cumulative payoffs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Variable Neighborhood Search
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A $k$-Sample Model in Order Statistics
- Scheduling
- Handbook of metaheuristics
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Heuristics for a flowshop scheduling problem with stepwise job objective function
