Scheduling with Sequencing Flexibility

Sequencing with limited flexibility

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...

Adaptive job-shop scheduling with routing and sequencing flexibility using expert knowledge and coloured Petri nets

Petri Nets are known to be efficient for modeling manufacturing systems, because they have a graphical representation and a well-defined semantics allowing formal analysis. Considering conflicts as routingand sequencing alternatives, we propose a knowledge based algorithm for on-line scheduling, that guides the search for a near optimal schedule in the state space efficiently and limits the sta...

Order Selection and Scheduling with Leadtime Flexibility

Robotic cell scheduling with operational flexibility

In this paper, we study the problem of two-machine, identical parts robotic cell scheduling with operational $exibility. We assume that every part to be processed has a number of operations to be completed in these two machines and both machines are capable of performing all of the operations. The decision to be made includes 8nding the optimal robot move cycle and the corresponding optimal all...

Pricing and scheduling decisions with leadtime flexibility

This paper studies a problem faced by a manufacturer who has the ability to set prices to influence demand, reject orders, and set leadtimes or due-dates for accepted orders. We present decision models that integrate pricing and production decisions for the cases where the manufacturer charges the same price or different prices to different customers. Through numerical analyses, we present insi...