INTRODUCTION There has been a surge in the number of vape shops in the USA. Research on the marketing practices of e-cigarette manufacturers is scarce and even less known are the practices of vape shop retailers. Past research on tobacco marketing has shown differences in the amount and content of marketing material, based on a community's demographic profile. This study examined marketing stra...

Many applications make use of hybrid programming models intermixing task and data parallelism in order to exploit modern architectures more eeciently. However, unbalanced computational load or idle times due to tasks that are blocked either in I/O or waiting on results from other tasks can cause signiicant performance problems. Fortunately, such idle times can be overlapped with useful computat...

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in production scheduling. To improve the efficacy solving complicated multiobjective MNIFSP, a MultiDirection Update (MDU) based Multiobjective Particle Swarm Optimization (MDU-MoPSO) proposed this study. For biobjective optimization problem...

In this paper we present the performance analysis of two nite queues coupled by a triggering scheduler Customers waiting for service have rst to pass the scheduler and then experience service by their dedicated server The scheduler is permitted to gather a custo mer from a particular queue only if the corresponding server is idle An application of this model can be found in job shop like manufa...

This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel’s approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is improved using a forward shift heuristic...

Allocating buffers in manufacturing systems is one of easiest ways to improve the throughput of the system, as changes can be implemented quickly and the initial cost of the change is low. Yet, while an increase in the buffer size usually increases the throughput, it often also increases the work in progress and the makespan, therefore increasing the inventory and the time to the customer. Subs...

Allocating buffers in manufacturing systems is one of easiest ways to improve the throughput of the system, as changes can be implemented quickly and the initial cost of the change is low. Yet, while an increase in the buffer size usually increases the throughput, it often also increases the work in progress and the makespan, therefore increasing the inventory and the time to the customer. Subs...