A local search algorithm for the flow shop scheduling problem with release dates

DOI10.1155/2015/320140zbMath1418.90120OpenAlexW1993720449WikidataQ59105813 ScholiaQ59105813MaRDI QIDQ1723292

Meiting Guo, Lin Lin, Tao Ren, Yunhui Miao

Publication date: 19 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/320140

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ On a flow-shop scheduling problem with fuzzy pentagonal processing time

Cites Work

• Unnamed Item
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
• Existence of homoclinic orbits for a class of asymptotically \(p\)-linear aperiodic \(p\)-Laplacian systems
• Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
• Optimal two- and three-stage production schedules with setup times included
• Fifty years of scheduling: a survey of milestones
• Flowshop and Jobshop Schedules: Complexity and Approximation
• New heuristics for flow shop problem to minimize makespan

This page was built for publication: A local search algorithm for the flow shop scheduling problem with release dates