Academic
Publications
Operations Scheduling with Applications in Manufacturing and Services

Operations Scheduling with Applications in Manufacturing and Services,X. Chao,M. Pinedo

Operations Scheduling with Applications in Manufacturing and Services   (Citations: 105)
BibTex | RIS | RefWorks Download
Published in 1998.
Cumulative Annual
    • ...From an historical point of view, interest in JiT manufacturing appeared after the Second World War in the Toyota factories (see the short description of Pinedo and Chao (1999)), which had to meet due dates for orders whilst dealing with the non-negligible storage costs of the orders produced...

    T'kindt Vincent. Multicriteria models for just-in-time scheduling

    • ...Scheduling Problem (RCPSP) [6] and job shop scheduling problem [7]...

    Stephen Remdeet al. Binary Exponential Back Off for Tabu Tenure in Hyperheuristics

    • ...These three features of the FJSP significantly increase the complexity of finding even approximately optimal solutions (Pinedo & Chao, 1999, chap...
    • ...Furthermore, if well designed, CDRs can solve realistic problems with multiple objectives (Pinedo & Chao, 1999, chap...

    Joc Cing Tayet al. Evolving dispatching rules using genetic programming for solving multi...

    • ...Furthermore, minimizing the total completion time of the jobs in a plant is equivalent to minimizing the average number of jobs in the plant and hence minimizing the congestion of the plant (Pinedo and Chao 1999, Hopp and Spearman 2000)...

    Zhi-long Chenet al. Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems

    • ...In collaboration with an industrial partner we have studied a workforce scheduling problem which is a resource constrained scheduling problem similar to but more complex and “messy” than many other well-studied scheduling problems like the RCPSP (Resource Constrained Project Scheduling Problem) and job shop scheduling problem, for which much work has been done [1]...
    • ...Our workforce scheduling problem is concerned with assigning people and other resources to geographically dispersed tasks while respecting time window constraints and is like many scheduling problems NP-Hard [1] because it contains the RCPSP as a sub-problem...
    • ...The RCPSP is a generalisation of several common scheduling problems including job-shop, open-shop and flow-shop scheduling problems [1]...
    • ...Precedence constraints are a major part of the RCPSP model and in many RCPSP problems the precedence constraints are arguably the most complex constraints with every task involved in a precedence relationship with one or more other tasks [1]...

    Peter I. Cowlinget al. The Trade Off Between Diversity and Quality for Multi-objective Workfo...

Sort by: