Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
From MaRDI portal
Publication:2268520
DOI10.1007/S10951-009-0109-9zbMATH Open1182.90050OpenAlexW2081401598MaRDI QIDQ2268520FDOQ2268520
Authors: Rui Zhang, George Steiner 
Publication date: 8 March 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0109-9
Recommendations
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries
- Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
- scientific article; zbMATH DE number 123937
- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Machine scheduling with transportation considerations
- Machine scheduling with deliveries to multiple customer locations
- Fast approximation algorithm for job sequencing with deadlines
- Integrated Scheduling of Production and Distribution Operations
- Algorithms for Scheduling Independent Tasks
- Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost
- Supply Chain Scheduling: Batching and Delivery
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- The coordination of scheduling and batch deliveries
- Coordinated supply chain management
- Supply chain scheduling: sequence coordination
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
- Batch scheduling in a two-level supply chain -- a focus on the supplier
- Title not available (Why is that?)
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
- A Hybrid Algorithm for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures
- Title not available (Why is that?)
- BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
Cited In (12)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Cost allocation in rescheduling with machine unavailable period
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- An uncertain programming model for single machine scheduling problem with batch delivery
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
This page was built for publication: Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268520)
