No abstract

In today's competitive markets, the importance of good scheduling strategies in manufacturing companies lead to the need of developing efficient methods to solve complex scheduling problems.In this paper, we studied two production scheduling problems with sequence-dependent setups times. The setup times are one of the most common complications in scheduling problems, and are usually associated with cleaning operations and changing tools and shapes in machines.The first problem considered is a single-machine scheduling with release dates, sequencedependent setup times and delivery times. The performance measure is the maximum lateness.The second problem is a job-shop scheduling problem with sequence-dependent setup times where the objective is to minimize the makespan.We present several priority dispatching rules for both problems, followed by a study of their performance. Finally, conclusions and directions of future research are presented.2

Purpose-This paper analyses the interaction of two topics: Supply Chain Management (SCM) and the Internet. Merging these two fields is a key area of concern for contemporary managers and researchers. They have realised that the Internet can enhance SCM by making real time information available and enabling collaboration between trading partners. Design/methodology/approach-A literature review in prestigious academic journals in Operations Management and Logistics has been conducted for the period 1995-2005. The objective is to collect, organise and synthesise existing knowledge relating to SCM and the Internet. Findings-Our study has described the impact that the Internet has on the different processes that SCM embrace. The literature review undertaken on the topic has shown that e-SCM has been acknowledged as an outstanding topic in the supply chain literature in the most prestigious Operations Management and Logistics journals, especially after year 2000. The main topics have been e-procurement, e-fulfilment and information flows. Originality/value-The value of this paper is to define e-SCM, to analyse how research in this area has evolved during the period 1995-2005 and to identify some lines of further research.

No abstract

In this paper we present an algorithm to assign proctors to exams. This NPhard problem is related to the generalized assignment problem with multiple objectives. The problem consists of assigning teaching assistants to proctor final exams at a university. We formulate this problem as a multiobjective integer program (IP) with a preference function and a workload-fairness function. We then consider also a weighted objective that combines both functions. We develop a scatter search procedure and compare its outcome with solutions found by solving the IP model with CPLEX 6.5. Our test problems are real instances from a University in Spain.