• Publications
  • Influence
Tabu search for the job-shop scheduling problem with multi-purpose machines
TLDR
In this paper we study the following generalization of the job-shop scheduling problem which belongs to the hardest problems in combinatorial optimization. Expand
  • 337
  • 33
  • PDF
A master surgical scheduling approach for cyclic scheduling in operating room departments
TLDR
This paper addresses the problem of operating room (OR) scheduling at the tactical level of hospital planning and control. Expand
  • 232
  • 19
Management and Control of Domestic Smart Grid Technology
TLDR
A three-step control methodology using a hierarchical plan is proposed to manage the cooperation between these technologies, focused on domestic energy streams. Expand
  • 578
  • 15
  • PDF
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
TLDR
We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs for the case that no geometric representation of the graph is available. Expand
  • 90
  • 14
  • PDF
A Branch & Bound Algorithm for the Open-shop Problem
TLDR
A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem. Expand
  • 146
  • 12
  • PDF
An exact approach for relating recovering surgical patient workload to the master surgical schedule
TLDR
We propose an analytical approach to project the workload for downstream departments based on this MSS. Expand
  • 173
  • 11
  • PDF
Makespan minimization for flow-shop problems with transportation times and a single robot
  • J. Hurink, S. Knust
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 15 September 2001
TLDR
In a flow-shop problem with transportation times and a single robot n jobs consisting of m operations have to be processed in the same order on m machines. Expand
  • 88
  • 9
Approximation schemes for wireless networks
TLDR
We present an approach that can be used to create polynomial-time approximation schemes for several optimization problems called the local neighborhood-based scheme. Expand
  • 51
  • 9
A tabu search algorithm for scheduling a single robot in a job-shop environment
TLDR
We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. Expand
  • 72
  • 8
  • PDF
Tabu search algorithms for job-shop problems with a single transport robot
TLDR
We consider a generalized job-shop problem where the jobs additionally have to be transported between the machines by a single transport robot. Expand
  • 93
  • 8
  • PDF