Concurrent open shop scheduling to minimize the weighted number of tardy jobs

DOI10.1023/A:1024284828374zbMath1027.90033OpenAlexW2012691563MaRDI QIDQ1404274

D. Massart

Publication date: 21 August 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024284828374

zbMATH Keywords

schedulingdue dateconcurrent open shopin-approximability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Customer order scheduling to minimize the number of late jobs ⋮ The representation of partially-concurrent open shop problems ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ A note on the complexity of the concurrent open shop problem ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ A note on the complexity of two supply chain scheduling problems ⋮ Scheduling orders for multiple product types with due date related objectives

This page was built for publication: Concurrent open shop scheduling to minimize the weighted number of tardy jobs