scientific article
From MaRDI portal
Publication:3885495
zbMath0442.90040MaRDI QIDQ3885495
No author found.
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
single machinepolynomial algorithmrelease datesprecedence constraintspreemptive schedulen jobsminimization of maximum job completion cost
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (24)
Minimizing the stretch when scheduling flows of divisible requests ⋮ Single machine group scheduling with ordered criteria ⋮ An algorithm for single machine sequencing with release dates to minimize maximum cost ⋮ An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness ⋮ Scheduling problems with partially ordered jobs ⋮ Minimizing total completion time for preemptive scheduling with release dates and deadline constraints ⋮ Dynamic programming and minimum risk paths ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine ⋮ On the complexity of generalized due date scheduling problems ⋮ Production scheduling problems in a textile industry ⋮ Single machine scheduling with precedence constraints and positionally dependent processing times ⋮ Scheduling in a contaminated area: a model and polynomial algorithms ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness ⋮ Effective optimization methods for single-machine scheduling (survey) ⋮ A note on optimal assignment of slack due-dates in single-machine scheduling ⋮ A note on generalizing the maximum lateness criterion for scheduling ⋮ Nonpreemptive flowshop scheduling with machine dominance ⋮ Mathematical programming formulations for machine scheduling: A survey
This page was built for publication:
