Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Lars Mnch
Information about the author Lars Mnch will soon be added to the site.
Found
9 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An iterative approach for the serial batching problem with parallel machines and job families
2013
In this paper, we consider a parallel machine scheduling problem to minimize the total...
A methodology to solve large‐scale cooperative transportation planning problems
2012
In this paper, we suggest a methodology to solve a cooperative transportation planning...
Heuristic approaches for master planning in semiconductor manufacturing
2012
In this paper, we propose heuristic approaches for solving master planning problems...
A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations
2011
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting...
Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence‐dependent setup times, precedence constraints, and ready times
2011
In this paper, we discuss a scheduling problem for jobs on identical parallel...
Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
2007
In this paper, we consider a modified shifting bottleneck heuristic for complex job...
Decomposition heuristics for minimizing earliness–tardiness on parallel burn-in ovens with a common due date
2007
This paper considers a scheduling problem for parallel burn-in ovens in the...
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
2005
This research is motivated by a scheduling problem found in the diffusion and...
A distributed shifting bottleneck heuristic for complex job shops
2005
In this paper, we consider distributed versions of a modified shifting bottleneck...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers