An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
DOI10.1007/S40314-015-0218-3zbMATH Open1361.65040OpenAlexW2034920690MaRDI QIDQ520264FDOQ520264
Authors: Vahid Kayvanfar, Ehsan Teymourian, Mostafa Zandieh 
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0218-3
Recommendations
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- scientific article
- Minimizing total tardiness on a single machine with controllable processing times
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
numerical examplesschedulingmixed integer linear programmingtardinessidentical parallel machinesearlinesscontrollable processing timesmeta-heuristic algorithmsintelligent water drops algorithm
Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15) Mixed integer programming (90C11)
Cites Work
- A survey of scheduling with controllable processing times
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A survey of results for sequencing problems with controllable processing times
- Scheduling
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Parallel machine scheduling with earliness and tardiness penalties
- A multi-agent system for the weighted earliness tardiness parallel machine problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Parallel machine earliness and tardiness scheduling with proportional weights
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Single machine scheduling with common due date and controllable processing times
- An anticipative scheduling approach with controllable processing times
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Scheduling parallel CNC machines with time/cost trade-off considerations
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Just-in-time scheduling with controllable processing times on parallel machines
- Metaheuristics
- Intelligent water drops algorithm
- Single Machine Common Due Window Scheduling with Controllable Job Processing Times
Cited In (3)
This page was built for publication: An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520264)
