The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The flow shop scheduling polyhedron with setup times. ... The paper improves polyhedral representations for the flow shop scheduling problem with sequence dependent setup times and min- imization of the makespan. ...
A hybrid discrete/continuous flow shop supply chain with job shop processes at each supplier stage is studied with dynamic optimal control models. ... We consider operations, channel, resource and flow control models with multiple objectives. Computational procedure and model integration are described. ... Examples for multi-stage flow-shop scheduling problem with alternative machines at each stage with different time-dependent processing speed, and time-dependent machine availability can be found in the ...doi:10.1016/j.cie.2016.01.009 fatcat:d2xwdo2bjbh5hehi6uzhcco7pe
It is shown that the assembly problem is NP-hard in the strong sense, but the two-machine flow shop problem may be solved in polynomial time by the Gilmore-Gomory algorithm [P. C. Gilmore and R. E. ... in the processing times; (2) only setup times are separated from the processing times; and (3) both setup and re- moval times are separated. ...
However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. ... In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. ... workshop      , job shop ( [47,    ), and open shop [47, 54, 69] . (2) Setup time: in traditional scheduling problems, the processing times of jobs are assumed to be ...doi:10.1155/2017/7219656 fatcat:etqkmiracvdhfgg3ob6phzygxe
Lecture Notes in Computer Science
These include better models for capacity utilization and setup times, new models to represent the product structure -or recipes -in process industries, and the study of continuous time planning and scheduling ... The objective is to present the classical optimization approaches used, and the known models, for dealing with such management problems. ... Small buckets planning models are discrete time models with small time periods where the aim is to take detailed decisions about the materials flow in the shop floor, the sequence of production lots on ...doi:10.1007/3-540-45586-8_3 fatcat:rey4ahbdtfdplouy5dzidhvjki
Lecture Notes in Computer Science
Theme: ECCO is the annual meeting of the EURO working group on combinatorial optimization. ECCO was started in 1987 by a group of leading experts in Operations Research and Management Science. ... Topics of interest are found in all fields of combinatorial optimization, e.g. logistics, production, scheduling, resource and operations management, flexible manufacturing, VLSI design, network design ... The p-Center problem consists in locating p facilities among a set of M possible locations and assigning N clients to them in order to minimize the maximum distance between a client and the facility to ...doi:10.1007/11816157_107 fatcat:xjdnf4kesrbczoh4ilvxxixqei
The relation with DP also allows a new perspective to relate state-space relaxation methods for DP with arc flow models. ... To conclude, we review the main solution methods and applications of arc flow models based on DP in several domains such as cutting, packing, scheduling, and routing. ... The second and the fifth authors have been supported by FCT -Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020. ...arXiv:2010.00558v2 fatcat:fplyye4gkbcb3cyufmtxanofkm
A central problem in these facilities is how to schedule the equipment over the day to ensure batch production under tight equipment and workforce constraints. ... Computational testing using data provided by the Dallas P&DC confirmed the superiority of the piece-by-piece LP-based heuristic with respect to branch and bound, which proved to be computational expensive ... The two-machine, flow shop scheduling problem F 2|r i , ptmn|L max with n jobs is known to be NP-complete in the strong sense  . The problem is stated as follows. ...doi:10.1016/j.cor.2004.07.003 fatcat:2mcjsf6bvrdspbdd56dakba4xy
High multiplicity scheduling problems arise naturally in contemporary production settings where manufacturers combine economies of scale with high product variety. ... The paper extends the framework presented in Brauner et al. (2005) for single machine, non preemptive high multiplicity scheduling problems, to more general classes of problems. ... A job-oriented description of the schedule describes the complete routing of a job through the shop. The mapping S M T (k, t) describes the state of machine k at time t. ...doi:10.1111/j.1467-9574.2007.00362.x fatcat:lrlyn3hrmbajrcluhgygyb46wu
Jiang, A variant of the permutation flow shop model with variable processing times 76 (l-3) (1997) 123-140 Finkelstein, L., see G. Cooperman 37/38 (1992) 95-118 Finta, L. and Z. ... Isaak, Scheduling dyadic intervals 63 (2) (1995) 101-l 16 Dror, M., Openshop scheduling with machine dependent processing times 39 (1992) 197-205 Dror, M., G. Laporte and P. ...doi:10.1016/s0166-218x(00)00210-9 fatcat:vvomn3k7hbbmliptwaczxk6wi4
solutions with acceptable run times. ... We use the problem of scheduling an automotive stamping facility as a demonstrative example, showing how composite variable models and a novel corresponding algorithm can lead to high-quality, realistic ... Even the seemingly-simplistic case of scheduling a pure blocking flow shop has proven to be tremendously difficult, not only in the theoretical sense (  ) but also in practice, where even small, non-pathological ...doi:10.1080/07408170802512594 fatcat:hl3icprbpjg4rkcgb6ydpkhequ
It was a natural idea to turn the theses into a textbook on scheduling. ... They set out to compile a survey with Ron Graham (1979), but progress on the book was hampered by the many research opportunities offered by the field. ... and flow shop scheduling by Kawaguchi and Kyan  . ...arXiv:2001.06005v1 fatcat:5w7dwzh6nrbb7ateihvrac3734
Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously ... We are interested in the circuits of this system, the so-called minimal forbidden sets, which are minimal subsets of jobs that must not be scheduled simultaneously. ... We appreciate the input of two anonymous referees. Particularly the deep remarks of one of them greatly improved our understanding of several issues; he also suggested the simplified Example 1. ...doi:10.1007/s10107-004-0512-0 fatcat:boxujhsqv5bntmgs6aoq3twy2m
Szwarcfiter, Job shop scheduling with unit time operations under resource constraints and release dates 18 (1987) 227-233 491. H.H. Yanasse and N.Y. ... Nishida, Two machine mixed shop scheduling problem with controllable machine speeds 17 (1987) 29-38 453. N. Katoh and T. ...doi:10.1016/s0166-218x(00)00209-2 fatcat:l53yxlj45ffdrdecl3uah2gj3y
same time. ... The study developed a best practice for profit-optimised SCM for companies with capital intensive and capacity constrained resources such as in the steel companies and others of the process industry. ... , w 2 is setup time, setup cost, w 3 is max delay, w 4 is sum of delay and w 5 is production cost. ...doi:10.11118/ejobsat.v5i2.175 fatcat:xfeiqqs6lbgizit5yccqgtiwsa
« Previous Showing results 1 — 15 out of 78 results