Scheduling parallel machines with inclusive processing set restrictions and job rejection

DOI10.1002/nav.21728zbMath1411.90153OpenAlexW2580581123MaRDI QIDQ4632951

Jinwen Ou, Xiangtong Qi, Xueling Zhong

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21728

zbMATH Keywords

schedulingparallel machinesapproximationworst-case analysisjob rejection

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Parallel machine scheduling with restricted job rejection ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ Bicriteria order acceptance and scheduling with consideration of fill rate ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Parallel-machine scheduling in shared manufacturing

This page was built for publication: Scheduling parallel machines with inclusive processing set restrictions and job rejection