Scheduling the truckload operations in automatic warehouses
From MaRDI portal
Publication:863986
DOI10.1016/j.ejor.2005.03.066zbMath1163.90505OpenAlexW2076067355MaRDI QIDQ863986
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.066
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The job shop scheduling problem: Conventional and new solution techniques
- Lower bounds for resource-constrained project scheduling problems.
- The disjunctive graph machine representation of the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Optimal Storage Assignment in Automatic Warehousing Systems
- The Complexity of Flowshop and Jobshop Scheduling
- Computational Complexity of Discrete Optimization Problems
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Algorithms for Solving Production-Scheduling Problems
- Job Shop Scheduling by Local Search
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
This page was built for publication: Scheduling the truckload operations in automatic warehouses