A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
From MaRDI portal
Publication:1667779
DOI10.1016/j.apm.2012.10.001zbMath1426.90133OpenAlexW1983544204MaRDI QIDQ1667779
Seyed Reza Hejazi, Mohammad Mahdavi Mazdeh, Morteza Rasti Barzoki
Publication date: 30 August 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.10.001
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost ⋮ A knowledge-based approach for multi-factory production systems ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ Coordination of production and transportation in supply chain scheduling ⋮ Single-machine batch scheduling of linear deteriorating jobs ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single-machine batch scheduling minimizing weighted flow times and delivery costs
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Batch delivery scheduling with batch delivery cost on a single machine
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
- The coordination of transportation and batching scheduling
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Fast approximation algorithm for job sequencing with deadlines
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Flowshop scheduling with dominant machines
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Minimizing the weighted number of tardy jobs on a single machine
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Supply Chain Scheduling: Batching and Delivery
- Algorithms for Scheduling Independent Tasks
- Two-machine flowshop scheduling to minimize the number of tardy jobs
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
