scientific article; zbMATH DE number 3521521

Cited in

(21)

Optimal due-date assignment and sequencing
Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
Complexity of single machine, multi-criteria scheduling problems
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
On maximizing the throughput of multiprocessor tasks.
Parallel machine scheduling with a common server
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
Using short-term memory to minimize the weighted number of late jobs on a single machine.
A just-in-time scheduling problem with two competing agents
A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
A survey of single machine scheduling to minimize weighted number of tardy jobs
On the convexity of games corresponding to sequencing situations with due dates.
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
Maximizing the throughput of parallel jobs on hypercubes
Minimizing the weighted number of tardy jobs on a single machine with release dates
Single processor scheduling with job values depending on their completion times
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

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 Q4099215)