Approximations for the two-machine cross-docking flow shop problem

DOI10.1016/j.dam.2013.02.030zbMath1286.90065OpenAlexW1989447432MaRDI QIDQ2446855

Christophe Rapine, Damien Prot

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.030

zbMATH Keywords

approximation algorithmmakespanprecedence constraintstyped tasks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem ⋮ A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling cross docking operations under full, partial and no information on inbound arrivals
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• Partially ordered knapsack and applications to scheduling
• UET-scheduling with constrained processor allocations
• Analysis of scheduling problems with typed task systems
• Lifting valid inequalities for the precedence constrained knapsack problem
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Optimal two- and three-stage production schedules with setup times included
• Balanced coloring of bipartite graphs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
• On the complexity of scheduling problems for parallel/pipelined machines
• Bounds on Multiprocessing Timing Anomalies
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling

This page was built for publication: Approximations for the two-machine cross-docking flow shop problem