Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
From MaRDI portal
(Redirected from Publication:336752)
Recommendations
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Minimizing total tardiness on parallel machines with preemptions
- Minimizing total tardiness on a single machine with controllable processing times
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Scheduling on parallel identical machines to minimize total tardiness
- Minimizing maximum earliness on parallel identical machines
- Parallel Processing and Applied Mathematics
- Computing and Combinatorics
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 7618390 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A state-of-the-art review of parallel-machine scheduling research
- A survey of results for sequencing problems with controllable processing times
- A survey of scheduling with controllable processing times
- An anticipative scheduling approach with controllable processing times
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Just-in-time scheduling with controllable processing times on parallel machines
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
- Parallel machine earliness and tardiness scheduling with proportional weights
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Parallel machine match-up scheduling with manufacturing cost considerations
- Parallel machine scheduling models with fuzzy processing times
- Parallel machine scheduling with earliness and tardiness penalties
- 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
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
- Scheduling parallel CNC machines with time/cost trade-off considerations
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling unrelated parallel machines with sequence-dependent setups
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling with common due date and controllable processing times
- The Total Tardiness Problem: Review and Extensions
- Total absolute deviation of job completion times on uniform and unrelated machines
- Two parallel machine sequencing problems involving controllable job processing times
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
Cited in
(13)- A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
- Throughput optimization for the robotic cell problem with controllable processing times
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- A makespan minimization problem for versatile developers in the game industry
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- A moving block heuristic to minimise earliness and tardiness costs on parallel machines
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
- Integrated truck and workforce scheduling to accelerate the unloading of trucks
This page was built for publication: Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336752)
