Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
From MaRDI portal
Publication:2482802
Recommendations
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Scheduling with earliness-tardiness penalties and parallel machines
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Lower bounds for parallel machine scheduling problems
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Parallel machine scheduling with earliness and tardiness penalties
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
- Scheduling on parallel identical machines to minimize total tardiness
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
Cites work
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- An experimental study of LP-based approximation algorithms for scheduling problems
- An implementation of Shor's \(r\)-algorithm
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Improved Algorithms for Bipartite Network Flow
- Multicriteria scheduling
- Multicriteria scheduling problems: a survey
- On the \(k\)-coloring of intervals
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- Optimal timing of a sequence of tasks with general completion costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Preemption in single machine earliness/tardiness scheduling
- Solving project scheduling problems by minimum cut computations
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- The one-machine problem with earliness and tardiness penalties
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(28)- Exponential neighborhood search for a parallel machine scheduling problem
- The one-machine problem with earliness and tardiness penalties
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Optimal solutions for a dock assignment problem with trailer transportation
- Scheduling preparation of doses for a chemotherapy service
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- scientific article; zbMATH DE number 5151903 (Why is no real title available?)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Just-in-time single-batch-processing machine scheduling
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers
- Dynamic scheduling of patients in emergency departments
- Capacity allocation in a service system with preferred service completion times
- Scheduling with earliness-tardiness penalties and parallel machines
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Lower bounds for parallel machine scheduling problems
- A multi-agent system for the weighted earliness tardiness parallel machine problem
This page was built for publication: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482802)
