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

DOI10.1007/S40314-015-0218-3MaRDI QIDQ520264zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical examplesschedulingmixed integer linear programmingtardinessidentical parallel machinesearlinesscontrollable processing timesmeta-heuristic algorithmsintelligent water drops algorithm

Mathematics Subject Classification ID

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

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; zbMATH DE number 5951383
• Minimizing total tardiness on a single machine with controllable processing times
• A multi-objective optimization for preemptive identical parallel machines scheduling problem

Cites work

• 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 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
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Intelligent water drops algorithm
• 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
• Metaheuristics
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Parallel machine earliness and tardiness scheduling with proportional weights
• Parallel machine scheduling with earliness and tardiness penalties
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Scheduling
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• Single machine scheduling with common due date and controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(3)

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

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)