Parallel machine selection and job scheduling to minimize machine cost and job tardiness
From MaRDI portal
(Redirected from Publication:2387248)
Recommendations
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Parallel machine match-up scheduling with manufacturing cost considerations
- Scheduling on parallel identical machines to minimize total tardiness
- Parallel machine scheduling problems considering regular measures of performance and machine cost
- Parallel machine scheduling with earliness and tardiness penalties
- Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs
Cites work
- A tabu search algorithm for parallel machine total tardiness problem
- Defining tabu list size and aspiration criterion within tabu search methods
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 5241907 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- Parallel flowshop scheduling using Tabu search
- Parallel machine scheduling with earliness and tardiness penalties
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Sequencing with Earliness and Tardiness Penalties: A Review
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Tabu Search—Part I
- Tabu Search—Part II
- The Total Tardiness Problem: Review and Extensions
Cited in
(23)- A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Scheduling games on uniform machines with activation cost
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- Acquisition planning and scheduling of computing resources
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
- Parallel machine scheduling problems considering regular measures of performance and machine cost
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- scientific article; zbMATH DE number 1998803 (Why is no real title available?)
- Scheduling with variable time slot costs
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Logic-based benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption
- Uniform parallel machine scheduling problems with fixed machine cost
- Robust parallel machine selection and scheduling with uncertain release times
- A tabu search algorithm for unspecified parallel machine scheduling with shift consideration
- Uniform-machine scheduling problems in green manufacturing system
- A distributionally robust approach for the parallel machine scheduling problem with optional machines and job tardiness
- A modified adaptive large neighborhood search algorithm for solving network-shared manufacturing resource scheduling
- Scheduling parallel CNC machines with time/cost trade-off considerations
- Batching deteriorating items with applications in computer communication and reverse logistics
- Online algorithms for scheduling with machine activation cost on two uniform machines
- Batch scheduling in a two-stage flexible flow shop problem
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
This page was built for publication: Parallel machine selection and job scheduling to minimize machine cost and job tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387248)
