Single machine scheduling to minimize the number of early and tardy jobs

Recommendations

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Single-machine scheduling to minimize earliness and number of tardy jobs
Single-machine scheduling with early and tardy completion costs
Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
A single machine scheduling problem to minimize total early work

Cites work

scientific article; zbMATH DE number 3558962 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
scientific article; zbMATH DE number 553762 (Why is no real title available?)
A Functional Equation and its Application to Resource Allocation and Sequencing Problems
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
An Algorithm for the Space-Shuttle Scheduling Problem
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
Sequencing with Earliness and Tardiness Penalties: A Review
The parallel machine min-max weighted absolute lateness scheduling problem

Cited in

(52)

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
The just-in-time scheduling problem in a flow-shop scheduling system
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
Early-tardy minimization for joint scheduling of jobs and maintenance operations on a single machine
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
On the parameterized complexity of interval scheduling with eligible machine sets
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Maximizing weighted number of just-in-time jobs on unrelated parallel machines
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
Single-machine scheduling with a common due window
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
A just-in-time scheduling problem with two competing agents
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
Single-machine scheduling with supporting tasks
The Single Machine Early/Tardy Problem
Minimizing the number of late jobs when the start time of the machine is variable
Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
Single machine scheduling to minimize the setup time and the earliness
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
Single-machine scheduling with early and tardy completion costs
A note on the maximum number of on-time jobs on parallel identical machines.
Single machine scheduling to minimize the number of late jobs under uncertainty.
Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
Single-machine scheduling with job can be processed in advance
Just-in-time scheduling with generalized due dates and identical due date intervals
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
A note: minimizing maximum earliness on a proportionate flowshop
A composite heuristic for the single machine early/tardy job scheduling problem.
scientific article; zbMATH DE number 834592 (Why is no real title available?)
A state-of-the-art survey on multi-scenario scheduling
Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
A single machine scheduling problem to minimize total early work
A survey of single machine scheduling to minimize weighted number of tardy jobs
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Just-in-time scheduling under scenario-based uncertainty
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Just-in-time scheduling with controllable processing times on parallel machines
Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
A note: maximizing the weighted number of just-in-time jobs for a given job sequence
Parameterized multi-scenario single-machine scheduling problems
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Two-agent single-machine scheduling problem with just-in-time jobs
Single-machine scheduling problems with generalized preemption
Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties

This page was built for publication: Single machine scheduling to minimize the number of early and tardy jobs

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