The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
type: Item
instance of: scholarly article
title: The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
zbMATH Open document ID: 1391.90263
author: Jose M. Framinan
author: Paz Perez-Gonzalez
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
full work available at URL: https://idus.us.es/handle//11441/96664
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902772
zbMATH Keywords: scheduling
zbMATH Keywords: assembly
zbMATH Keywords: completion time
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W2738556598
cites work: Q5437765
cites work: Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
cites work: A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
cites work: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
cites work: The two-stage assembly scheduling problem to minimize total completion time with setup times
cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
cites work: Manufacturing Scheduling Systems
cites work: New approximate algorithms for the customer order scheduling problem with total completion time objective
cites work: A branch and bound algorithm for the two-stage assembly scheduling problem
cites work: The three-stage assembly flowshop scheduling problem
cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Variable neighborhood search
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
cites work: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
cites work: Minimizing the total completion time in a distributed two stage assembly system with setup times
DOI: 10.1016/J.COR.2017.07.012
Recommended article: A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
Recommended article: A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
Recommended article: Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Recommended article: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
Recommended article: The two-stage assembly scheduling problem to minimize total completion time with setup times
Recommended article: Q5437765
Recommended article: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
Recommended article: A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
Recommended article: Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function
description: scientific article; zbMATH DE number 6902772