@article {10906318320150205,
	title = {Analysis of the Deployment Quality for Intrusion Detection in Wireless Sensor Networks.},
	journal = {Journal of Computer Networks \& Communications},
	volume = {2015},
	year = {2015},
	pages = {1 - 7},
	abstract = {The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic int},
	keywords = {Intrusion detection systems (Computer security), Mathematical models, Probability theory, Wireless sensor networks, Wireless sensor nodes},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=109063183\&site=ehost-live},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay Ahmed and Ouadou, Mohamed and Aboutajdine, Driss}
}
@article {9954595520141215,
	title = {Solving a mixed integer linear program with times setup for the steel-continuous casting planning and scheduling problem.},
	journal = {International Journal of Production Research},
	volume = {52},
	number = {24},
	year = {2014},
	pages = {7276 - 7296},
	abstract = {In this paper, we present a novel model that generalise the steelmaking continuous casting planning and scheduling problem. The model includes three stages: converters namely CV, refining stands namely RS and continuous castings namely CC. The obtained problem can be formulated as a mathematical program with typical constraints, namely the times setup constraints. We develop a mixed integer linear program (MILP) to schedule several sequences of charges for more than two continuous castings devices. The aim is: (i) on one hand, to schedule a list of several sequences that are already ordered for each continuous casting with times setup between two successive sequences, (ii) on the other hand, to determine the optimal order of the successive sequences. We use a benchmark and randomly generated instances to test the model and solved by mean of the commercial software solverCplex v12.5. These problems span a variety of instances varying from small to large sized instances with different i},
	keywords = {Continuous casting, Linear programming, Mathematical models, Mathematical optimization, MILP, Mixed integer linear programming, optimisation, planning, Scheduling, setup, steel},
	issn = {00207543},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=99545955\&site=ehost-live},
	author = {Sbihi, Abdelkader and Bellabdaoui, Adil and Teghem, Jacques}
}
@article {5570174020110101,
	title = {Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines.},
	journal = {Annals of Operations Research},
	volume = {182},
	number = {1},
	year = {2011},
	pages = {213 - 233},
	abstract = {For a given choice of the maximum allowable total storage parameter, the performance of constant work-in-process (CONWIP) disciplines in unreliable transfer lines subjected to a constant rate of demand for parts, is characterized via a tractable approximate mathematical model. For a ( n?1) machines CONWIP loop, the model consists of n multi-state machine single buffer building blocks, separately solvable once a total of ( n?1) unknown constants shared by the building blocks are initialized. The multi-state machine is common to all building blocks, and its n discrete states approximate the joint operating state of the machines within the CONWIP loop; each of the first ( n?1) blocks maps into a single internal buffer dynamics, while the nth building block characterizes total work-in-process (wip) dynamics. The blocks correspond to linear n component state equations with boundary conditions. The unknown (shared) constants in the block dynamics are initialized and calculated by means of s},
	keywords = {Aggregation operators, CONWIP, Decomposition method (Mathematics), Decomposition/aggregation methods, Forward Kolmogorov equations, Mathematical models, Monte Carlo method, Operations research, Performance evaluation, Reliability (Engineering)},
	issn = {02545330},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=55701740\&site=ehost-live},
	author = {Mhada, Fatima and Malhame, Roland}
}
