A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination

Volume: 72, Issue: 9, Pages: 1929 - 1942
Published: Dec 18, 2019
Abstract
Integration of production and distribution operations at the scheduling level is one of the most important issues concerned in recent years in supply chain management. We investigate the scheduling problem with job delivery coordination. Concretely, we are given a set of jobs with non-identical processing times and non-identical sizes to be first processed by two parallel-identical machines and then delivered to a common customer by a single...
Paper Details
Title
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination
Published Date
Dec 18, 2019
Volume
72
Issue
9
Pages
1929 - 1942
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.