Single machine scheduling to minimize the number of early and tardy jobs
From MaRDI portal
Publication:1919786
DOI10.1016/0305-0548(95)00078-XzbMath0854.90081OpenAlexW2003673940MaRDI QIDQ1919786
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
Related Items
Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines ⋮ Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Maximizing weighted number of just-in-time jobs on unrelated parallel machines ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ 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 ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems ⋮ A note on the maximum number of on-time jobs on parallel identical machines. ⋮ A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ A note: minimizing maximum earliness on a proportionate flowshop ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Single-machine scheduling with a common due window ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem ⋮ JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY ⋮ Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling ⋮ On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- Sequencing with Earliness and Tardiness Penalties: A Review
- An Algorithm for the Space-Shuttle Scheduling Problem
- The parallel machine min-max weighted absolute lateness scheduling problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
