Results 231 to 240 of about 732,131 (298)
Advanced Functional Materials, EarlyView.Bio‐based and (semi‐)synthetic zwitterion‐modified novel materials and fully synthetic next‐generation alternatives show the importance of material design for different biomedical applications. The zwitterionic character affects the physiochemical behavior of the material and deepens the understanding of chemical interaction mechanisms within the ...
Theresa M. Lutz +3 more
wiley +1 more source
Evaluating Bio-Inspired Metaheuristics for Dynamic Surgical Scheduling: A Resilient Three-Stage Flow Shop Model Under Stochastic Emergency Arrivals. [PDF]
Biomimetics (Basel)Becerra-Rozas M +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
International Journal of Production Research, 1981
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
J. BROWNE, J. E. BOONJ, B. J. DAVIES
openaire +1 more source
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
J. BROWNE, J. E. BOONJ, B. J. DAVIES
openaire +1 more source
1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Flow Shops, Job Shops and Open Shops (Stochastic)
2008The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire +1 more source
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
IFAC Proceedings Volumes, 1989
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire +2 more sources
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire +2 more sources