In this paper, we study an integrated production scheduling and delivery routing problem. The manufacturer has to schedule a set of jobs on a single machine without preemption and to deliver them to multiple customers. A single vehicle with limited capacity is used for the delivery. For each job are associated: a processing time, a size and a specific customer location. The problem consists the...

The same kind of n jobs are processed one by one sequentially by a single machine and any number k of them may be processed as a batch. A setup time is necessary before the processing of the first job in a batch. The completion times of all the jobs in a batch are the same as the completion time of the last job in the batch and the processing time of the batch is the sum of a setup time and k t...

We introduce a natural but seemingly yet unstudied generalization of the problem scheduling jobs on single machine so as to minimize number tardy jobs. Our lies in simultaneously considering several instances at once. In particular, we have n clients over period m days, where each client has job with its own processing time and deadline per day. goal is provide schedule for that guaranteed thei...

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...

Since that a job usually contains several working procedures in actual production, and it’s hard to optimize the flexible collaborative planning, the flexible lot splitting and scheduling of the job simultaneously in batch production mode, a model for multiobjective integration of flexible collaborative planning and fuzzy lot-splitting scheduling is established. We take four performance indicat...

Inserted idle time occurs when a machine is kept waiting deliberately for the arrival of a job that is still being processed on a preceding machine. A common assumption in most of the existing literature on flowshop scheduling is that inserted idle time is not allowed, and whenever there are jobs that are ready for processing on a given machine, that machine is not kept idle for any reason. Thi...

Focusing on the just-in-time (JIT) operations management, earliness as well as, tardiness of jobs’ production and delivery should be discouraged. In accordance to this philosophy, scheduling problems involving earliness and tardiness penalties are very critical for the operations manager. In this paper, a new population heuristic based on the particle swarm optimization (PSO) technique is prese...

In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup ...

This paper presents and evaluates an order release decision rule in a job-shop, based on the input-output control concept. The order release mechanism is part of a global decision-making scheme that includes four main decisions: accept/reject orders, define the order’s due date, release the accepted jobs and dispatch it on the shop floor. This paper also presents an evaluation of two acceptance...