Finding efficient make-to-order production and batch delivery schedules

DOI10.1016/j.ejor.2021.04.020zbMath1487.90267MaRDI QIDQ2242200

David Bachtenkirch, Stefan Bock

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.04.020

zbMATH Keywords

scheduling; metaheuristics; branch and bound; batch delivery; make-to-order production

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery, A review on integrated scheduling and outbound vehicle routing problems, New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
• Coordinated scheduling of production and delivery with production window and delivery capacity constraints
• A zero-inventory production and distribution problem with a fixed customer sequence
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• A probabilistic heuristic for a computationally difficult set covering problem
• A fixed interval due-date scheduling problem with earliness and due-date costs
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• Integrated production and distribution scheduling with a perishable product
• Sequencing the processing of incoming mail to match an outbound truck delivery schedule
• Greedy randomized adaptive search procedures
• On the fixed interval due-date scheduling problem
• Commitment-penalty contracts in drop-shipping supply chains with asymmetric demand information
• Set covering with almost consecutive ones property
• Single machine scheduling with delivery dates and cumulative payoffs
• Integrated production and distribution with fixed delivery departure dates
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Algorithms for the Assignment and Transportation Problems
• Scheduling with Fixed Delivery Dates
• The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization
• Two-Processor Scheduling with Start-Times and Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing with due-dates and early start times to minimize maximum tardiness
• Scheduling independent tasks to reduce mean finishing time
• Reducibility among Combinatorial Problems
• Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs
• Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints