scientific article; zbMATH DE number 3691044

zbMATH Open0442.90040MaRDI QIDQ3885495FDOQ3885495

Authors:

Publication date: 1980

Title of this publication is not available (Why is that?)

zbMATH Keywords

single machinepolynomial algorithmrelease datesprecedence constraintspreemptive schedulen jobsminimization of maximum job completion cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (24)

• Scheduling problems with partially ordered jobs
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• Mathematical programming formulations for machine scheduling: A survey
• Minimizing the stretch when scheduling flows of divisible requests
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
• Dynamic programming and minimum risk paths
• Scheduling in a contaminated area: a model and polynomial algorithms
• On the complexity of generalized due date scheduling problems
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
• The job shop scheduling problem: Conventional and new solution techniques
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• A note on generalizing the maximum lateness criterion for scheduling
• Effective optimization methods for single-machine scheduling (survey)
• Production scheduling problems in a textile industry
• A note on optimal assignment of slack due-dates in single-machine scheduling
• Preemptive scheduling with simple linear deterioration on a single machine
• Nonpreemptive flowshop scheduling with machine dominance
• Scheduling with due date assignment under special conditions on job processing
• Single machine group scheduling with ordered criteria
• Vyacheslav Tanaev: contributions to scheduling and related areas
• Single machine scheduling with precedence constraints and positionally dependent processing times
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885495)