* Starting from Need* Evolution of the Toyota Production System* Further Development* Genealogy of the Toyota Production System* The True Intention of the Ford System* Surviving the Low-Growth Period

Toyota production system : beyond large-scale production

https://ira.lib.polyu.edu.hk/bitstream/10397/1269/1/SetupSurvey-2006%28June-19%29.pdf

A survey of scheduling problems with setup times or costs

A survey on problems and methods in generalized assembly line balancing

An important class of machine scheduling problems is characterized by a no-wait or blocking production environment, where there is no intermediate buffer between machines. In a no-wait environment, a job must be processed from start to completion, without any interruption either on or between machines. Blocking occurs when a job, having completed processing on a machine, remains on the machine until a downstream machine becomes available for processing. A no-wait or blocking production environment typically arises from characteristics of the processing technology itself, or from the absence of storage capacity between operations of a job. In this review paper, we describe several well-documented applications of no-wait and blocking scheduling models and illustrate some ways in which the increasing use of modern manufacturing methods gives rise to other applications. We review the computational complexity of a wide variety of no-wait and blocking scheduling problems and describe several problems which remain open as to complexity. We study several deterministic flowshop, jobshop, and openshop problems and describe efficient and enumerative algorithms, as well as heuristics and results about their performance. The literature on stochastic no-wait and blocking scheduling problems is also reviewed. Finally, we provide some suggestions for future research directions.

A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

A classification of assembly line balancing problems

This paper concerns the problem of optimally scheduling a set of appliances at the end-user premises. In the context of electricity smart grids, the electric energy fee varies over time and the user may receive a reward from an energy aggregator if he/she modifies his/her consumption profile during certain time intervals. The problem is to schedule the operation of the appliances taking into account overall costs, climatic comfort level and timeliness. We devise a MILP model and a heuristic algorithm accounting for a typical household user. Several numerical simulation results are reported, showing that the problem can be efficiently solved in real-life instances.

Load Scheduling for Household Energy Consumption Optimization

We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs and total weighted completion time. The different combinations of the cost functions of each agent lead to various problems, whose computational complexity is analysed in this paper. In particular, we investigate the problem of finding schedules whose cost for each agent does not exceed a given bound for each agent.

/pdf/multi-agent-single-machine-scheduling-ihy4fhw4in.pdf

Multi-agent single machine scheduling

Supply chain scheduling: sequence coordination

Scheduling no-wait robotic cells with two and three machines

In this paper, we develop branch-and-bound algorithms for several hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. Our bounding approach is based on the fact that, for all problems considered, the Lagrangian dual gives a good bound and can be solved exactly in strongly polynomial time. The problems addressed here consist in minimizing the total weighted completion time of the jobs of agent A, subject to a bound on the cost function of agent B, which may be: (i) total weighted completion time, (ii) maximum lateness, (iii) maximum completion time. An extensive computational experience shows the effectiveness of the approach.

Alessandro Agnetis

Papers

Load Scheduling for Household Energy Consumption Optimization

Multi-agent single machine scheduling

Supply chain scheduling: sequence coordination

Scheduling no-wait robotic cells with two and three machines

A Lagrangian approach to single-machine scheduling problems with two competing agents