scientific article; zbMATH DE number 3430360
From MaRDI portal
Publication:5181074
zbMath0273.90032MaRDI QIDQ5181074
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs ⋮ A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ k-optimal solution sets for some polynomially solvable scheduling problems ⋮ A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop ⋮ A multi-objective approach to resource allocation in single machine scheduling ⋮ Minimizing the number of tardy jobs in single machine sequencing ⋮ Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals ⋮ Scheduling of unit-length independent tasks with execution constraints ⋮ Parallel machine scheduling to minimize costs for earliness and number of tardy jobs ⋮ Single-machine scheduling to minimize earliness and number of tardy jobs
This page was built for publication:
