An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach

DOI10.1007/s40314-015-0218-3zbMath1361.65040OpenAlexW2034920690MaRDI QIDQ520264

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

zbMATH Keywords

schedulingnumerical examplesearlinessmixed integer linear programmingtardinessidentical parallel machinescontrollable processing timesmeta-heuristic algorithmsintelligent water drops algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ An uncertain parallel machine problem with deterioration and learning effect

Cites Work

• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Scheduling parallel CNC machines with time/cost trade-off considerations
• A survey of results for sequencing problems with controllable processing times
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• 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
• Parallel machine scheduling with earliness and tardiness penalties
• Two parallel machine sequencing problems involving controllable job processing times
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• 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
• A multi-agent system for the weighted earliness tardiness parallel machine problem
• A survey of scheduling with controllable 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
• Metaheuristics
• Sequencing with Earliness and Tardiness Penalties: A Review
• Intelligent water drops algorithm
• Single Machine Common Due Window Scheduling with Controllable Job 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
• Scheduling

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