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...

This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...

In soft real-time applications, tasks are allowed to miss their deadlines. Thus, less-costly scheduling algorithms can be used at the price of occasional violations of timing constraints. This may be acceptable if reasonable tardiness bounds (i.e., bounds on the extent to which deadlines may be missed) can be guaranteed. In this paper, we consider soft real-time applications implemented on mult...

Problem of scheduling on a single machine to minimize total weighted tardiness of jobs can be described as follows: there are n jobs to be processed, each job has an integer processing time, a weight and a due date. The objective is to minimize the total weighted tardiness of jobs. The problem belongs to the class of NP-hard problems. Some new properties of the problem associated with the block...

This paper presents several local search meta-heuristics for the problem of scheduling a single machine to minimise total weighted tardiness. A genetic algorithm for the static single machine total weighted tardiness problem is presented, and a multi-start version named metaGA is proposed. The obtained computational results permit to conclude about their efficiency and effectiveness. The resolu...

The controls for reconfigurable manufacturing systems have to be capable not only of identifying exceptions on-line, but also simultaneously developing on-line strategies for unpredictable customer orders or inaccurate estimates of processing times. This paper presents an approach for job-shop scheduling with uncertain arrival times. The approach exploits Virtual Supervisor (VS) concept, which ...

I n this article, we study the newsvendor problem with endogenous setting of price and quoted lead-time. This problem can be observed in situations where a firm orders semi-finished product prior to the selling season and customizes the product in response to customer orders during the selling season. The total demand during the selling season and the lead-time required for customization are un...