An improved algorithm for a two-stage production scheduling problem with an outsourcing option
From MaRDI portal
Publication:2034787
DOI10.1016/j.tcs.2021.05.022zbMath1504.90059OpenAlexW3165185214MaRDI QIDQ2034787
Xiaojuan Jiang, Guangting Chen, Kangbok Lee, Yong Chen, An Zhang
Publication date: 23 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.05.022
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Cites Work
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Two-machine flow shop scheduling problem with an outsourcing option
- Supply chain scheduling to minimize holding costs with outsourcing
- Scheduling with an outsourcing option on both manufacturer and subcontractors
- The coordination of single-machine scheduling with availability constraints and delivery
- Optimization of processing and delivery decisions involving third-party machines
- The longest processing time rule for identical parallel machines revisited
- Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
- Two-stage production scheduling with an outsourcing option
- Competition and Outsourcing with Scale Economies
- An ILP-based Proof System for the Crossing Number Problem
- A Brownian Approximation of a Production-Inventory System with a Manufacturer That Subcontracts
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
This page was built for publication: An improved algorithm for a two-stage production scheduling problem with an outsourcing option