scientific article
From MaRDI portal
Publication:3680271
zbMath0565.68037MaRDI QIDQ3680271
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (45)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Minimizing the weighted number of tardy task units ⋮ Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays ⋮ Scheduling imprecise computation tasks on uniform processors ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ A single machine scheduling problem to minimize total early work ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Scheduling imprecise computation tasks with \(0/1\)-constraint ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ Scheduling with competing agents, total late work and job rejection ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Open shop scheduling problems with late work criteria. ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Approximation algorithms for scheduling a single machine to minimize total late work ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ Scheduling two agents with controllable processing times ⋮ The two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Minimizing mean weighted execution time loss on identical and uniform processors ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Minimizing total weighted late work in the resource-constrained project scheduling problem ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Mirror scheduling problems with early work and late work criteria ⋮ A note on a single machine scheduling problem with generalized total tardiness objective function ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
This page was built for publication:
