Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs

DOI10.1016/S0166-218X(99)00025-6zbMath0940.90034MaRDI QIDQ1293204

Marek Mika, Grzegorz Waligóra, Joanna Józefowska, Rafal Rózycki, Jan Weglarz

Publication date: 28 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

discrete-continuous scheduling problemsmetaheuristics simulated anneling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Scheduling shared continuous resources on many-cores ⋮ On a certain class of power- and energy-related scheduling problems ⋮ Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• On a methodology for discrete-continuous scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• The tabu search metaheuristic: How we used it
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• Tabu Search—Part I
• Tabu Search—Part II
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs