INTRODUCTION E-cigarettes have increased in popularity and given rise to a new type of sales outlet-the vape shop. Expanding on work examining vape shop employee e-cigarette and tobacco attitudes and behaviors1, this study examined key messages that vape shop employees communicate to customers. METHODS Using informal interviews, observations, and a cross-sectional survey, we examined vape sho...

In a shop floor of the industry, the routings which are based upon the jobs that need to be processed on different machines are one among the major activities and therefore the resource requirements are not based upon the quantity as in a flow shop but rather the routings for the products being produced. However, both job shop and flow shop production cope with a scheduling problem to find a fe...

In this study, a real world flow shop with a transportation restriction is regarded. This restriction reduces the set of feasible schedules even more than the no-buffer restrictions discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. This NP-hard problem is solved by priority rule...

Security vulnerabilities often result from buffer overflows. A testing technique that instruments programs with code that keeps track of memory buffers, and checks arguments to functions to determine if they satisfy certain conditions, warns when a buffer overflow may occur. It does so when executed with ”normal” test data as opposed to test data designed to trigger buffer overflows. A tool usi...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

This paper studies the complexity variations of scheduling problems in diierent machine environments when replacing operations with arbitrary processing times by the chains of operations with unit processing times. Special attention is paid to polynomial-time algorithms for chain-like precedence-constrained problems with unit processing times and transformations of their solutions to each other...

This simulation study explores and compares the potential benefits of three work-in-process inventory drive systems and their associated inventory buffer characteristics. The three inventory drives are a push, a pull and a hybrid push-pull system. While these systems have some aspects in common, their buffer management systems vary. The statistical analysis associated with the study was based o...

Appropriate production plans can make resources utilized effectively as well as minimize waste. However, currently most of the precast fabricators propose production plans depending on the rule of thumb, resulting in the squander of resources and postponed delivery. Computerized scheduling techniques provide more precise outcomes than those made manually. The goal of this study is to develop a ...

A variation of preemptive open shop scheduling corresponds to nding a feasible edge coloring in a bipartite multigraph with some requirements on the size of the di erent color classes. We show that for trees with xed maximum degree, one can nd in polynomial time an edge k-coloring where for i = 1; : : : ; k the number of edges of color i is exactly a given number hi, and each edge e gets its co...