Background Recognizing the significant impact of wait times for care for individuals with complex chronic conditions, we applied a LEAN methodology, namely – an adaptation of Value Stream Mapping (VSM) to meet the needs of people with multiple chronic conditions and to improve wait times without additional resources or funding.   Methods Over an 18-month time period, staff applied a patient-cen...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

background recognizing the significant impact of wait times for care for individuals with complex chronic conditions, we applied a lean methodology, namely – an adaptation of value stream mapping (vsm) to meet the needs of people with multiple chronic conditions and to improve wait times without additional resources or funding.   methods over an 18-month time period, staff applied a patient-cen...

We consider the problem of minimizing makespan in a no-wait flow-shop with an arbitrary number of machines. We assume that all sublots have the same number of items. We consider the cases with or without loading times. In both cases we show the existence of a critical machine which never remains idle. Then we get a set of general conditions on the processing times and loading times, which bind ...

This paper studies the single hoist scheduling problem in no-wait flexible flow shop system with constant process times. The objective is to minimize the make span in the given job tasks. Different jobs have different process routes and process times. When a job starts, workstation must be free to process the job, and as soon as it is finished, the hoist must be free to move it to the next work...

We propose a constructive heuristic for the well known NP-hard problem of no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the sequence is given by the sum of its processing times on the bottleneck machine(s) for selecting the initial sequence of jobs. The computational experimentations show that there is a significant improvement in solution quality ove...