Quick search
Advanced search in
Field to searchTerm
Optimal Job Insertion in Complex Job Shop Scheduling: Model, Method, and Applications (161720)
Add rule
The following results are related to Canada. Are you interested to view more results? Visit OpenAIRE - Explore.
Download Results
2 research outcomes, page 1 of 1
  • publication . Article . 2018
    Open Access
    Authors:
    Reinhard Bürgy; Kerem Bülbül;
    Persistent Identifiers
    Publisher: Elsevier BV
    Project: SNSF | Optimal Job Insertion in ... (161720)

    Abstract The job shop scheduling literature has been dominated by a focus on regular objective functions – in particular the makespan – in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total ...

  • publication . Article . 2016
    Closed Access
    Authors:
    Pierre Baptiste; Reinhard Bürgy; Alain Hertz; Djamal Rebaine;
    Persistent Identifiers
    Project: SNSF | Optimal Job Insertion in ... (161720)

    This paper addresses the problem of minimising the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data are known in advance, the problem is efficiently solvable with a dynamic programming approach. However, this method is rar...

2 research outcomes, page 1 of 1