Single machine scheduling to minimize the number of early and tardy jobs
From MaRDI portal
DOI10.1016/0305-0548(95)00078-XzbMATH Open0854.90081OpenAlexW2003673940MaRDI QIDQ1919786FDOQ1919786
Authors: Avital Lann, Gur Mosheiov 
Publication date: 24 July 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00078-x
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- The parallel machine min-max weighted absolute lateness scheduling problem
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- An Algorithm for the Space-Shuttle Scheduling Problem
- Title not available (Why is that?)
Cited In (52)
- 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
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- Early-tardy minimization for joint scheduling of jobs and maintenance operations on a single machine
- 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
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Single-machine scheduling with a common due window
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- A just-in-time scheduling problem with two competing agents
- 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
- Single machine scheduling to minimize the setup time and the earliness
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Single-machine scheduling with early and tardy completion costs
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
- 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
- Just-in-time scheduling with generalized due dates and identical due date intervals
- Single-machine scheduling with job can be processed in advance
- 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
- Title not available (Why is that?)
- A composite heuristic for the single machine early/tardy job scheduling problem.
- A note: minimizing maximum earliness on a proportionate flowshop
- 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
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Just-in-time scheduling under scenario-based uncertainty
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Just-in-time scheduling with controllable processing times on parallel machines
- 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
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
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)
