Minimizing makespan in two-stage hybrid cross docking scheduling problem

DOI10.1016/j.cor.2008.07.003zbMath1179.90032OpenAlexW2088252115MaRDI QIDQ1001000

Feng Chen, Kailei Song

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.003

zbMATH Keywords

machine schedulinglogisticscross docking

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

Synchronization in cross-docking networks: a research classification and framework, Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem, An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries, A comparison of formulations and relaxations for cross-dock door assignment problems, Exact algorithms for inventory constrained scheduling on a single machine, Scheduling cross docking operations under full, partial and no information on inbound arrivals, A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach, Truck scheduling in cross-docking terminals with fixed outbound departures, Truck routing and scheduling for cross-docking in the supply chain: model and solution method, Approximation algorithms for inventory constrained scheduling on a single machine, A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem, Automated sortation conveyors: a survey from an operational research perspective, Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors, A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock, Part logistics in the automotive industry: decision problems, literature review and research agenda

Uses Software

• CPLEX

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Modeling realistic hybrid flexible flowshop scheduling problems
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Scheduling of flexible flow lines in an automobile assembly plant
• Minimizing makespan in hybrid flowshops
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• Optimal two- and three-stage production schedules with setup times included
• A flowshop scheduling problem with two operations per job
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Unnamed Item
• Unnamed Item